15-453 Formal Languages, Automata, and Computation
Overview
This course provides an introduction to formal languages, automata,
computability, and complexity. It consists of a traditional lecture
component supported by weekly homework assignments and occasional
problem solving sessions. There are two midterms and a final
examination.
Topics
- Finite Automata and Regular Languages
- Pushdown Automata and Context-Free Languages
- Turing Machines, Decidability, Reducibility
- Time Complexity, Classes P and NP, NP-completeness
- Space Complexity, Class PSPACE
[ Home
| Schedule
| Assignments
| Handouts
| Overview
]
fp@cs
Frank Pfenning
|