15453 Formal Languages, Automata, and Computation
Lecture 5: NonDeterministic Finite Automata
We review the definitions of both deterministic and nondeterministic
finite automata and then prove that DFAs and NFAs recognize the same
languagesthe regular languages.
[ Home
 Schedule
 Assignments
 Handouts
 Overview
]
fp@cs
Frank Pfenning
