GATE Theory of Computation
GATE Theory of Computation PREV NEXT Menu -> GATE 2024 CS1 -> GATE 2023 -> GATE 2022 -> GATE 2021 SYLLABUS Regular expressions and finite automata. Context-free grammars and push-down automata.Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Q1 – Let 𝐿1, 𝐿2 be two regular languages and 𝐿3 a language which is […]