CSE 202 Theory of Automata

Unit A Finite Automata

Introduction to languages, Kleene closures, Finite Automata (FA), Transition
Unit A
graph, Nondeterministic finite Automata (NFA), Deterministic finite Automata
Topic 1
(DFA).
Unit A Equivalence of NDFA and DFA, Construction of DFA from NFA and optimization
Topic 2 of Finite Automata.
Unit A
Applications and Limitation of FA. (FAT tool).
Topic 3
Unit B Regular Expression and Finite Automata
Unit B Regular Expression, Finite Automata with null move, Regular Expression to Finite
Topic 1 Automata.
Unit B
Arden Theorem, Pumping Lemma for regular expressions.
Topic 2
Unit B
FA with output: Moore machine, Mealy machine and Equivalence.
Topic 3
Unit C REGULAR & CONTEXT FREE LANGUAGE
Unit C Defining grammar, Chomsky hierarchy of Languages and Grammar. Ambiguous to
Topic 1 Unambiguous CFG.
Unit C
Simplification of CFGs.
Topic 2
Unit C
Normal forms for CFGs, Pumping lemma for CFLs.
Topic 3
Unit D PUSH DOWN AUTOMATA
Unit D
Description and definition of PDA and Non-Deterministic PDA, Working of PDA.
Topic 1
Unit D
Acceptance of a string by PDA with final state and with Null store. Two stack PDA.
Topic 2
Unit D
Conversion of PDA into CFG, Conversion of CFG into PDA.
Topic 3
Unit E TURING MACHINE
Unit E Turing machines (TM): Basic model, definition and representation, Language
Topic 1 acceptance by TM.
Unit E Turing machine as a computational machine, Halting problem of TM, Universal TM
Topic 2 (Visual Turing machine).
Unit E Modifications in TM, Undecidability of Post correspondence problem, Church’s
Topic 3 Thesis, Godel Numbering.
Peter Linz
K.L.P.Mishra