Sampath Kumar S

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