NFAtoFA - Converting an NFA into an FSA Proving LNFA is a...

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

View Full Document Right Arrow Icon
Converting an NFA into an FSA Proving LNFA is a subset of LFSA.
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 presents an example execution of the algorithm which takes as input an NFA (without λ - transitions) and produces as output an equivalent FSA • Algorithm Specification – Input: NFA M 1 (without λ -transitions) – Output: FSA M 2 such that L(M 2 ) = L(M 1 )
Background image of page 2
Input NFA M 1 a b a,b b b aa 1 2 3 4 5 6
Background image of page 3

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

View Full DocumentRight Arrow Icon
Initialization a b a,b b b aa 1 2 3 4 5 6 ab {1} Initial State of FSA M 2 : {1}
Background image of page 4
Expand State {1} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3}
Background image of page 5

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

View Full DocumentRight Arrow Icon
Add States {2} and {3} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {3}
Background image of page 6
Expand State {2} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {} {} {3}
Background image of page 7

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

View Full DocumentRight Arrow Icon
Add State {} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {} {} {3} {}
Background image of page 8
Expand State {3} a b a,b b b aa 1 2 3 4 5 6 ab {1} {2} {3} {2} {} {} {3} {3,4} {3,5} {}
Background image of page 9

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

View Full DocumentRight Arrow Icon
Add States {3,4} and {3,5} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {} {} {3} {3,4} {3,5} {} {3,4} {3,5}
Background image of page 10
Expand State {} a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {} {} {3} {3,4} {3,5} {} {} {} {3,4} {3,5}
Background image of page 11

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

View Full DocumentRight Arrow Icon
No New States Added a b a,b b b aa 1 2 3 4 5 6 a b {1} {2} {3} {2} {} {} {3} {3,4} {3,5} {} {} {} {3,4} {3,5}
Background image of page 12
Expand State {3,4} a b a,b b b aa 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}
Background image of page 13

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

View Full DocumentRight Arrow Icon
Image of page 14
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 / 23

NFAtoFA - Converting an NFA into an FSA Proving LNFA is a...

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

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