Class 5 formal languages and automata theory Syllabus

• DFA
• Equivalence of DFA and NFA
• NFA
• Closure Properties
• Pumping Lemma
• Regular Expressions
• Ambiguity
• CFG
• Parse Trees
• Equivalence with CFG
• PDA
• Decidability
• Turing Machine Model
• Undecidability