NtoFIntuition

# NtoFIntuition - Converting an NFA into an FSA Why the...

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

Why the algorithm works! Converting an NFA into an FSA

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

View Full Document
Purpose This presentation attempts to give the reader some intuition as to why the algorithm which takes as input an NFA without λ -transitions and produces as output an equivalent FSA works correctly . We use the example from the previous presentation to illustrate this intuition.
Why the Construction Works a b a,b b b a a 1 2 3 4 5 6 a b { 1 } {2} {3} {2} {} {} {3} {3,4} {3,5} {} {} {} {3,4} {3,4,6} {3,5} {3,5} {3,4} {3,5,6} { 3,4,6 } {3,4,6} {3,5} { 3,5,6 } {3,4} {3,5,6} NFA Equivalent FSA Input String babaa

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

View Full Document
Key Idea a b a,b b b a a 1 2 3 4 5 6 a b { 1 } {2} {3} {2} {} {} {3} {3,4} {3,5} {} {} {} {3,4} {3,4,6} {3,5} {3,5} {3,4} {3,5,6} { 3,4,6 } {3,4,6} {3,5} { 3,5,6 } {3,4} {3,5,6} NFA Equivalent FSA We will illustrate the computation of both the NFA and the FSA on the input string babaa . In all configurations, the set of states the NFA is in will be identical to the state the FSA is in.
Initial Configurations a b a,b b

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.

## This note was uploaded on 07/25/2008 for the course CSE 460 taught by Professor Torng during the Fall '07 term at Michigan State University.

### Page1 / 10

NtoFIntuition - Converting an NFA into an FSA Why the...

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

View Full Document
Ask a homework question - tutors are online