Theory Of Computation Practice Questions

Master topic for Context Free Grammar. Includes Context-Free Grammars (CFG), Normal Forms (CNF & GNF).

Master topic for Context Free Language. Includes Pumping Lemma for CFL.

Generate GATE-level questions covering decidable and undecidable problems, halting problem, reductions, and recursively enumerable languages. Include proof and reduction-based questions.

Master topic for Finite Automata. Includes Finite Automata (DFA & NFA).

Master topic for Push-down Automata. Includes Pushdown Automata (PDA).

Master topic for Recursive Language. Includes Introduction to TOC.

Generate GATE-level questions covering formation of regular expressions, equivalence of regular expressions, and conversion between regular expressions and finite automata. Include expression simplification and construction problems.

Master topic for Regular Grammarr. Includes Chomsky Hierarchy.

Master topic for Regular Language. Includes Pumping Lemma for Regular Languages.

Generate GATE-level questions covering definition of Turing Machines, transitions, configurations, variants (multi-tape, non-deterministic), and language recognition. Include TM design problems.