operators that the construction yields an automaton that accepts the language
denoted by any particular regular expression. We will not belabor this point, as it
is reasonably obvious that the results are always correct.
Figure 3.1
(a) nfa accepts Ø.
(b) nfa accepts {λ}.
(c) nfa accepts {a}.
Figure 3.2
Schematic representation of an nfa accepting L(r).
Figure 3.3
Automaton for L(r 1 + r 2 ).
Figure 3.4