Chapter 1 : Automata Theory
Topic : Automata Theory
Content : Defining Automaton, Finite Automaton, Transitions
properties, Acceptability by Finite Automaton.
153 MB ,1:1:10 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability by Finite Automata
Content : Examples for starting and ending pattern
52 MB ,25:26 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability by automata
Content : DFA Complementation
57 MB ,36:7 MIN , THEORY
Chapter 1 : NFA ,NFA and DFA equivalance
Topic : Automata Theory
Content : NFA ,NFA and DFA equivalance
121 MB ,1:0:42 MIN , THEORY
Chapter 1 : Automata Theory
Topic : DFA Minimization
Content : DFA Minimization basics and Examples
103 MB ,39:46 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Mealy and Moore machine
Content : Introduction to Output Generators
83 MB ,41:18 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Mealy and Moore machine
Content : Moore Examples
56 MB ,30:5 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Mealy and Moore machine
Content : Mealy Examples
50 MB ,34:33 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Moore Mealy Conversion
Content : Moore to Mealy Conversion
Mealy to moore conversion
48 MB ,21:15 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Defining Grammar, Derivations, Languages generated by Grammar
Content : Introduction to Grammar, Designing your own grammar
185 MB ,58:29 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability by Finite Automata
Content : Examples of Automata and understanding langugages
48 MB ,30:28 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Formal Languages:Defining Grammar, Derivations, Languages generated by Grammar
Content : Defining Grammar, Derivations, Languages generated by Grammar
113 MB ,58:29 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability by automata
Content : Examples on Finite Automata part1
41 MB ,26:16 MIN , THEORY
Chapter 1 : Automata Theory
Topic : Acceptability by automata
Content : Operations on DFA
58 MB ,35:8 MIN , THEORY
Chapter 2 : Formal Languages
Topic : Recursive Enumerable sets
Content : Recursive Enumerable language and Recursive language
10 MB ,5:25 MIN , THEORY
Chapter 2 : Formal Languages
Topic : comsky classification of grammar and languages
Content : comsky classification of grammar and languages
119 MB ,37:35 MIN , THEORY
Chapter 2 : Context Free Languages:
Topic : CFG simplification
Content : epsilon-removal, unit production elimination, and Useless symbol elimination
59 MB ,32:12 MIN , THEORY
Chapter 2 : Context Free Languages:
Topic : Normal Form
Content : Chomsky and Greichback normal form
83 MB ,58:24 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Regular expressions
Content : Examples of Regular Expression
62 MB ,37:5 MIN , THEORY
Chapter 3 : PushDownAutomata
Topic : Definition, Acceptance by PDA
Content : Definition, Acceptance by PDA, the example set 1
86 MB ,44:49 MIN , THEORY
Chapter 3 : PushDownAutomata
Topic : PDA and CGF
Content : Equivalence of PDA-CFG: conversion of PDA to CFG
120 MB ,43:55 MIN , THEORY
Chapter 2 : Context Free Languages:
Topic : Pumping lemma for CFG
Content : Pumping lemma for CFG
59 MB ,31:41 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Regular Grammar
Content : Introduction to Regular grammar, types of regular grammar,
RG to FA and FA to RG conversion
37 MB ,24:16 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Pumping Lemma and its application
Content : Pumping lemma for Regular languages
43 MB ,22:16 MIN , THEORY
Chapter 1 : Regular sets and Regular Grammar
Topic : Finite automata and Regular Expression
Content : Finite automata to RE conversion (Arden's Theorm)
68 MB ,39:3 MIN , THEORY
Chapter 2 : Turing Machine
Topic : TuringMachine Definition, Representation and Design of Turing Machine
Content : TuringMachine Definition, Representation and Design of Turing Machine
189 MB ,43:4 MIN , THEORY
Chapter 2 : Turing Machine
Topic : Construction of Turing Machines
Content : examples of Turing Machine
72 MB ,34:2 MIN , THEORY
Chapter 3 : Undecidability
Topic : Universal Turing Machine
Content : Universal Turing Machine
49 MB ,22:53 MIN , THEORY
Chapter 3 : Undecidability
Topic : Halting Problem
Content : Halting Problem
15 MB ,7:45 MIN , THEORY
Chapter 2 : Turing Machine
Topic : Variants of Turing Machine
Content : Variants of Turing Machine
33 MB ,18:46 MIN , THEORY
Chapter 3 : Undecidability
Topic : Church-Turing-Thesis
Content : Computability, decidability and Church-Turing-Thesis
159 MB ,22:12 MIN , THEORY
Chapter 3 : Undecidability
Topic : Introduction to unsolvable problems
Content : Introduction to unsolvable problems( p , np ,np hard and NP complete)
29 MB ,14:12 MIN , THEORY