Theory of Computation
5 articles in this topic
Ambiguous Grammars, Precedence and Associativity for GATE: Grammar Classification Questions Solved
Learn how to prove that a grammar is ambiguous, then remove expression ambiguity by encoding operator precedence and associativity into the grammar itself.
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.
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.
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.
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.