HW3Soln

# HW3Soln - I chose to remove states in numerical order....

This preview shows pages 1–4. Sign up to view the full content.

CSCI 2670 Fall 2005 HW 3 September 13, 2005 1.7d 1.7h 1.16b Below is the state transition table. The states in the first column that are highlighted are accept states. The start state will be {q 1 , q 2 } since this is the set of states that can be reached from {q 1 } using 0 or more ε jumps. a b {1} {1,3} {2} {1,2} {3} {2} {2,3} {1,2} {1, 2, 3} {1,3} {1, 2, 3} {2,3} {2,3} {1,2} {2,3} {1, 2, 3} {1, 2, 3} {2,3} The DFA is below. I only include states that can be reached from the start state.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
1.21b First create the GNFA from the DFA (omit transitions) Now remove one state at a time.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the 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

## HW3Soln - I chose to remove states in numerical order....

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online