| | |
Summary: Theory of Computation
Lecture 4: Nondeterministic Finite Automata
Max Alekseyev
University of South Carolina
January 19, 2012
Lecture Outline
Nondeterminism
Nondeterministic Finite Automata
NFA Computation
Equivalence of DFAs and NFAs
Regular Languages revisited
Clean NFA
Nondeterminism
In a DFA, the next state is completely determined by the current
state and the symbol being scanned, according to the transition
function .
In a nondeterministic finite automaton, there may be a choice of
several states to transition into at each step, and we may decide
not to advance the read head.
The machine accepts the input iff there is some series of choices
|
