Theory of Computation

27 articles in this topic

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 readTheory 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 readTheory of Computation