Finite Automata (GATE CS) — GATE Computer Science and Information Tec…
Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability.
- Exam: GATE Computer Science and Information Technology (CS)
- Section: Theory of Computation