University Computer Science
Automata Theory
Theory of Computation, formal languages, and the mathematical analysis of the problem-solving capacities of abstract machines.
Curriculum / Syllabus
- Finite Automata (DFA, NFA) and Regular Expressions
- Context-Free Grammars and Pushdown Automata
- Turing Machines and Computability
- Decidability and The Halting Problem
- Time and Space Complexity Classes (P, NP, PSPACE)
Exam & Course Strategy
Has a completely abstract and theoretical format. Tests grammar rules and the drawing of state machines that accept/reject specific languages.