15-453 Formal Languages, Automata, and Computation
Lecture 5: Non-Deterministic Finite Automata

We review the definitions of both deterministic and non-deterministic finite automata and then prove that DFAs and NFAs recognize the same languages---the regular languages.

• Reading: Ch. 1, pp. 53-58, lecture05.ps, lecture05.pdf
• Previous lecture: Model Checking
• Next lecture: Regular Expressions

[ Home | Schedule | Assignments | Handouts | Overview ]

fp@cs
Frank Pfenning