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

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