some missing edges, we continue until we obtain the complete solution in Figure
2.16.
Figure 2.15
Figure 2.16
One important conclusion we can draw from Theorem 2.2 is that every
language accepted by an nfa is regular.
EXERCISES