handouts/ho03.tex
changeset 497 c498cb53a9a8
parent 495 7d9d86dc7aa0
child 518 aecbe0077f2d
equal deleted inserted replaced
496:5c9de27a5b30 497:c498cb53a9a8
   184     case _ => Sink
   184     case _ => Sink
   185   }
   185   }
   186 \end{lstlisting}}  
   186 \end{lstlisting}}  
   187 
   187 
   188 \noindent I let you think what the corresponding DFA looks like in the
   188 \noindent I let you think what the corresponding DFA looks like in the
   189 graph notation.
   189 graph notation. Also, I suggest you to tinker with the Scala code in
       
   190 order to define the DFA that does not accept any string at all. 
   190 
   191 
   191 Finally, I let you ponder whether this is a good implementation of
   192 Finally, I let you ponder whether this is a good implementation of
   192 DFAs or not. In doing so I hope you notice that the $\varSigma$ and
   193 DFAs or not. In doing so I hope you notice that the $\varSigma$ and
   193 $Qs$ components (the alphabet and the set of finite states,
   194 $Qs$ components (the alphabet and the set of finite states,
   194 respectively) are missing from the class definition. This means that
   195 respectively) are missing from the class definition. This means that