Sampath Kumar S

toc automation dfa finite automata ε-nfa cfg normal forms pda introduction to grammar pumping lemma for regular sets minimization of dfa using myhill-nerode theorem: re fa conversion nfa regular expression regular language variants ndfa techniques for turing machines construction halting problem finite automaton introduction chomskian hierarchy of languages cse dpda equivalence of pushdown automata and cfl moves pushdown automata ambiguity cnf chomsky normal form (cnf) gnf grebach normal form (gnf) pumping lemma for cfl derivation recursive inference. derivations and languages turing machines context free languages context free grammars types of grammar primitive recursive functions