Next: Exercise 3.
Up: Quiz9
Previous: Exercise 1.
Give a deterministic automaton that recognizes
the same language as the non-deterministic finite automaton
shown on Figure 1
Answer 2

Figure 1:
A non-deterministic finite automaton with instantaneous transitions.
![\begin{figure}\htmlimage
\centering\includegraphics[scale=.5]{DFAandNFAIT-1.eps}
\end{figure}](img3.png) |
Next: Exercise 3.
Up: Quiz9
Previous: Exercise 1.
Marc Moreno Maza
2004-12-02