chapter002 Finite State Automata, Rebular Languages, and Regular Expressions
section003Nondeterministic Finite State Automata
Our Second NFSA

A Second Example of a Nondeterministic Finite State Automaton

Notice how we can easily extend the NFSA of the previous example to recognize all binary strings that end in 001, 101, or 100.