This preview shows pages 1–4. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: I chose to remove states in numerical order. Remove state 1. Remove state 2. Remove state 3. So the regular expression is (a b)a * b((b a(a b))a * b) * ( a). 1.19a Below are the NFAs N 1 and N 2 accepting the languages 0 and 1 Combining these to create NFA N 3 accepting 0 1 gives Therefore, the NFA N 4 accepting (0 1) * is Therefore the NFA accepting (0 1) * 000(0 1) * will be the concatenation of N 4 N 1 N 1 N 1 N 4 as shown below...
View
Full
Document
 Spring '11
 sm

Click to edit the document details