Theory of Computation MCQs
Solved Theory of Computation MCQs: finite automata, context-free grammars, pushdown automata.
25 articles in this topic
NFA to DFA Conversion MCQs: 12 Solved Questions with Explanations
Solve 12 published NFA to DFA MCQs with concise explanations, power-set calculations, and a complete four-state subset construction.
Mealy Machine MCQs: 11 Solved Questions with State-Trace Explanations
Solve 11 Mealy machine MCQs using state tables, edge-output traces and fresh explanations. Each answer shows how to eliminate plausible options.
FA to Regex Conversion MCQs: 12 Solved Questions with Explanations
Solve 12 published FA to regex conversion MCQs, then use short witness strings, loop analysis and path decomposition to check each answer.
Epsilon NFA Conversion MCQs: 10 Solved Questions with Explanations
Solve ten epsilon NFA MCQs step by step, from closure traces and shortest accepted strings to subset construction and NFA-DFA equivalence.
Closure Properties MCQs: 12 Solved CFL Questions with Explanations
Solve 12 published CFL closure questions, then use concise explanations to separate general closure rules from regular-operand and particular-language exceptions.
String Operations MCQs: 12 Solved TOC Questions Explained
Work through 12 published MCQs using concrete strings, interval counts, left-to-right traces and counterexamples. Each answer explains the convention that makes it correct.
Moore Machine MCQs: 10 Solved Questions on Outputs, States and Patterns
Solve 10 Moore machine questions with fresh explanations based on output rules, transition traces and state invariants. The set includes MCQs, a NAT and short-answer checks.
Regular Grammar and Finite Automata MCQs: 12 Solved Questions with Explanations
Practice 12 Regular Grammar and finite automata MCQs with worked parity, grammar-to-DFA, Myhill-Nerode and exact-language explanations.
P, NP and Reducibility MCQs: 12 Solved Questions with Explanations
Attempt 12 explained PYQs on P, NP, co-NP, NP-hardness, NP-completeness, SAT and polynomial-time reductions, then use the recap to fix reversed arrows.
Formal Language Operations & Sets MCQs: 11 Solved Questions
Work through 11 solved questions on Kleene star membership, complements, concatenation duplicates, language powers, palindrome counts and empty-language algebra.
Chomsky Hierarchy and Grammar Basics MCQs: 10 Solved Questions
Solve 10 previous-year questions on the Chomsky hierarchy, grammar restrictions, recognising machines, language inclusion, derivations and ambiguity. Each answer gives a worked reason and names the exam trap to avoid.
TM Variations and UTM MCQs: 10 Questions Explained
Ten solved MCQs on Turing machine variants and universal machines, nine of them previous-year questions from GATE, UGC NET, ISRO and more, with reasoning.