Textbook in PDF format Automata Theory : Defining Automaton, Finite Automaton, Transitions and its properties, Acceptability by Finite Automaton, Nondeterministic Finite State Machines, DFA and NDFA equivalence, Mealy and Moore Machines, Minimizing Automata. Formal Languages : Defining Grammar, Derivations, Languages generated by Grammar, Comsky Classification of Grammar and Languages, Recursive Enumerable Sets, Operations on Languages, Languages and Automata. Regular Sets and Regular Grammar : Regular Grammar, Regular Expressions, Finite automata and Regular Expressions, Pumping Lemma and its Applications, Closure Properties, Regular Sets and Regular Grammar. context Free Languages : Context-free Languages, Derivation Tree, Ambiguity of Grammar, CFG simplification, Normal Forms, Pumping Lemma for CFG. Pushdown Automata : Definitions, Acceptance by PDA, PDA and CFG. Linear Bound Automata : The Linear Bound Automata Model, Linear Bound Automata and Languages. Turing Machines : Turing Machine Definition, Representations, Acceptability by Turing Machines, Designing and Description of Turing Machines, Turing Machine Construction, Variants of Turing Machine. Undecidability : The Church-Turing thesis, Universal Turing Machine, Halting Problem, Introduction to Unsolvable Problems