Theory of Computation
48 articles in this topic
Turing Machines in Theory of Computation: Design, Worked Trace and Decidability
A six-state Turing machine for L = {0^n1^n}: built from the seven-tuple, traced move by move on 0011 to XXYY and q_accept, then proved a decider rather than only a recogniser.
Updated 8 Aug 20266 min read71 viewsTheory of Computation
Theory of Computation (TOC): Complete Guide with Worked Examples
Connect the main ideas of TOC through worked examples, from alphabets and DFA traces to grammars, stacks, Turing machines and decidability.
Updated 6 Aug 20266 min read103 viewsTheory of Computation
Regular Language Properties: Closure, Decision Tests, and Worked Examples
Connect closure properties, decision tests, and proof tools through product automata, pumping arguments, Myhill-Nerode reasoning, and checked string traces.
Updated 3 Aug 20267 min readTheory of Computation
Grammar in Theory of Computation: Complete Guide with Worked Examples
Learn how grammars generate languages, classify all four Chomsky types, convert a regular grammar to an NFA, detect ambiguity, and use CNF step counts.
Updated 1 Aug 20266 min readTheory of Computation
Chomsky Hierarchy for GATE: Classifying a Grammar as Regular, Context-Free, Context-Sensitive or Type-0
Classify grammars mechanically from their production forms. Four worked boundary cases show exactly when a grammar moves from regular to CFG, CSG or Type-0.
Updated 29 Jul 20265 min readTheory of Computation
Rice's Theorem for GATE: The Mechanical Test for Undecidability Questions
Run the semantic and non-trivial checklist on six machine properties, learn when Rice is silent, and separate undecidable from RE or non-RE.
Updated 26 Jul 20266 min readTheory of Computation
NFA to DFA Conversion for GATE: Subset Construction and State-Count Numericals
Convert two small NFAs into complete DFAs, handle epsilon-closure and the dead state, and separate the reachable state count from the 2^n worst case.
Updated 24 Jul 20266 min read104 viewsTheory of Computation
Ambiguous Grammars, Precedence and Associativity for GATE: Two-Tree Proofs and Grammar Rewrites
Proving a grammar ambiguous takes one witness string and two parse trees. Removing the ambiguity takes precedence layers plus a chosen recursion direction.
Updated 21 Jul 20265 min readTheory of Computation
DFA Minimization for GATE
Remove unreachable states, split final from non-final states, and refine until every transition signature is stable. A complete six-state example shows each split.
Updated 29 Jul 20265 min read84 viewsTheory of Computation
Turing Machines and Decidability: recursive vs RE, and the halting problem
Turing machines and decidability explained: TM definition and configurations, recursive vs recursively enumerable languages, the halting problem, reductions.
Updated 14 Jul 20266 min readTheory of Computation
Context-Free Grammars and Pushdown Automata: CFGs, PDAs, and a worked example
Context-free grammars and pushdown automata explained: derivations, ambiguity, CNF and GNF, PDA acceptance modes, the pumping lemma, and a worked example.
Updated 29 Jul 20266 min read59 viewsTheory of Computation
Finite automata: DFA vs NFA, with the exam angle
Finite automata explained: the DFA and NFA 5-tuple, DFA vs NFA, a worked subset construction converting an NFA to a DFA, equivalence, and the exam angle.
Updated 14 Jul 20265 min read55 viewsTheory of Computation