Theory of Computation — GATE Computer Science and Information Technol…
Theory of Computation for GATE Computer Science and Information Technology (CS): all 9 topics, with study resources and previous year questions for each.
Topics in Theory of Computation
- Regular Expressions (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Finite Automata (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Context-Free Grammars (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Push-Down Automata (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Regular Languages (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Context-Free Languages (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Pumping Lemma (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Turing Machines (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…
- Undecidability (GATE CS) — Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and u…