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

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Why the algorithm works! Converting an NFA into an FSA
Background image of page 1

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

View Full DocumentRight Arrow Icon
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.
Background image of page 2
Why the Construction Works a b a,b b b aa 1 2 3 4 5 6 ab { 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
Background image of page 3

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

View Full DocumentRight Arrow Icon
Key Idea a b a,b b b aa 1 2 3 4 5 6 ab { 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.
Background image of page 4
Initial Configurations a b a,b b b aa 1 2 3 4 5 6 ab {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} ( 1 , babaa) ( {1} , babaa)
Background image of page 5

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

View Full DocumentRight Arrow Icon
Second Configurations a b a,b b b aa 1 2 3 4 5 6 ab {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} (1, babaa) ({1}, babaa) ( 3 , abaa) ( {3} , abaa)
Background image of page 6
Third Configurations a b a,b b b aa 1 2 3 4 5 6 ab {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}
Background image of page 7

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

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

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

View Full DocumentRight Arrow Icon
Background image of page 10
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 10

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

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

View Full Document Right Arrow Icon
Ask a homework question - tutors are online