Theory of Computation
Formal languages, automata, and computational complexity.
📝 Topics
- Finite Automata: DFA, NFA, and state elimination.
- Regular Languages: Closure properties and expressions.
- Context-Free Languages: CFGs and closure.
- Pushdown Automata: NPDA and DPDA.
- Pumping Lemma: Proofs for non-regularity.
- Turing Machines and Undecidability: Decidability and Rice's Theorem.
- Myhill-Nerode: State minimization theorem.
Back to Core CS