This preview shows page 1. Sign up to view the full content.
Unformatted text preview: a b 3. (12pts) Consider the following NFA. a. (2 pts) Does it accept the string aa? List a possible sequence of state transitions (e.g., 1,3,4) leading to acceptance / rejection of aa. Yes: 1,2,4,1,2,4 b. (10 pts) Convert the NFA to a DFA using the subset construction algorithm discussed in class. Be sure to label each state in the DFA with the corresponding state(s) in the NFA. NFA DFA resulting from subset construction 1 3 2 & 4 a & a b 1,2 1,2 3,4 1 2,4 a a a b...
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