Theory of Computation MCQs
Solved Theory of Computation MCQs: finite automata, context-free grammars, pushdown automata.
18 articles in this topic
Context-Free Grammar MCQs: 12 Solved CFG Questions
Solve 12 previous-year CFG questions from GATE, UGC NET and ISRO papers by deriving the language, testing counterexamples and applying standard grammar transformations. Each answer gives the shortest useful reasoning.
DFA Basics and Definitions MCQs: 12 Solved Questions with Explanations
Solve 12 previous-year DFA questions from GATE, ISRO, HPSC, UPPSC and Beltron, with explanations for state counts, language recognition, full traces and regular-language limits.
NFA Basics & Design MCQs: 12 Solved Questions with Explanations
Solve 12 NFA questions with exact options and explanations of closure, minimality, length constraints, unions, state sets and language equivalence.
Regex and FA Equivalence MCQs: 10 Solved Questions with Explanations
Work through ten Regex and FA Equivalence MCQs on language comparison, careful pattern parsing, minimum-state counting, complementation and remainder tracking.
Context-Free Grammar MCQs: 11 solved questions on CFG, CFL and PDA
Context-free grammar solved MCQs with explanations: 11 GATE PYQs on CFGs, the Chomsky hierarchy, CFL closure properties, pushdown automata and decidability.
Finite Automata MCQs: 10 solved questions on DFA, NFA and minimization
Finite automata solved MCQs with explanations: 10 GATE PYQs on DFA design, minimal-state counting, complement, and the NFA to DFA subset-construction bound.