Theory of computation
Description
Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages including context-free languages and regular sets. Important problems including the halting problem and language equivalence theorems.
Links
Topics
- Introduction to the Theory of Compuation
Key Concepts - Finite Automata
- Regular Languages and Regular Grammars
- Properties of Regular Languages
- Context-Free Languages
- Simplification of Context-Free Grammars
- Pushdown Automata
- Properties of Context-Free Languages
- Turing Machines
- Other Models of Turing Machines
- A Hierarchy of Formal Languages and Automata
- Limits of Algorithmic Computation
- Other Models of Computation
- An Introduction to Computational Complexity