Theory of Computation category


#1

Regular expressions and finite automata(DFA and NFA). Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.

Please discuss above topics only. Cheers


#2

A post was split to a new topic: Recursive Language Question ? Mentors please tell the approach