Automaton for L(r 1 r 2 ).
Figure 3.5
Automaton for L( ).
Example 3.7
Find an nfa that accepts L(r), where
r=(a + bb)* (ba* + λ)
Automata for (a + bb) and (ba* + λ), constructed directly from first principles,
are given in Figure 3.6. Putting these together using the construction in Theorem
3.1, we get the solution in Figure 3.7.
Figure 3.6
(a) M 1 accepts L(a + bb).
(b) M 2 accepts L (ba* + λ).
Figure 3.7