Unformatted text preview: You must use the algorithm described in class for full credit. x ε ε ε ε ε ε y ε 3. (8 pts) Convert the following NFA into a DFA by applying the subset construction algorithm discussed in class. Be sure to list the NFA states represented by each DFA state. a 1 a ε ε 3 2 a ε 4 1,3,4 2,3,4 3,4 a a a...
View Full Document
- Fall '08
- following Ruby program, runtime exception. a., regular expression x|y*