This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: 4. (8 pts) Begin converting the following NFA into a DFA by applying the subset construction algorithm discussed in class. You do not need to produce the entire DFA. Create at least 2 DFA states (starting state & additional state) and the transition (with label) connecting them. Be sure to list the NFA states represented by each DFA state. ε 1 3 ε a ε ε b 4 5 2 ε ε 6 Answer Either of the two following DFA is correct. May contain additional transitions. 1,2,3 2,3, 5,6 a 1,2,3 1,2,3, 4,6 b # 8 points for correct answer # partial credit # 2 points for starting state of DFA corresponding to 1,2,3 # 2 points for 2 nd state of DFA corresponding to 2,3,5,6 (for -> a) # OR for 2 nd state of DFA corresponding to 1,2,3,4,6 (for -> b) # 2 points for correctly labeled transition # 2 points for realizing state containing 6 is final state...
View Full Document
This note was uploaded on 01/13/2012 for the course CMSC 330 taught by Professor Staff during the Fall '08 term at Maryland.
- Fall '08