GateBook

Theory of computation

Current Status
Not Enrolled
Price
Free
Get Started

Syllabus:
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
Very important topics: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages
Text Books: Theory of Computation by Ullman. Introduction to the Theory of Computation by Michael Sipser.T

Course Content

Expand All