Theory of Computation
Overview
Automata theory, computability, and complexity.
- Deterministic Finite Automata
- Non-Deterministic Finite Automata
- Context Free Grammars
- Regular Lanugages
- Regular Operations
- Equivalence of DFAs, NFAs, Regular Languages
References
- Sipser’s Introduction to the Theory of Computation. 3rd Edition.