Presentation is loading. Please wait.

Presentation is loading. Please wait.

Why the algorithm works! Converting an NFA into an FSA.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Why the algorithm works! Converting an NFA into an FSA."— Presentation transcript:

1 Why the algorithm works! Converting an NFA into an FSA

2 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.

3 Why the Construction Works a b a,b b b aa 1 2 3 4 5 6 NFAEquivalent FSA Input String babaa

4 Key Idea a b a,b b b aa 1 2 3 4 5 6 NFAEquivalent 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.

5 Initial Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa)

6 Second Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa) (3, abaa) ({3}, abaa)

7 Third Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa) (3, abaa) ({3}, abaa) (3, baa)(4, baa) ({3,4}, baa)

8 Fourth Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa) (3, abaa) ({3}, abaa) (3, baa)(4, baa) ({3,4}, baa) (3, aa)(5, aa)({3,5}, aa)

9 Fifth Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa) (3, abaa) ({3}, abaa) (3, baa)(4, baa) ({3,4}, baa) (3, aa)(5, aa)({3,5}, aa) (3, a)(4, a) ({3,4}, a)

10 Accepting Configurations a b a,b b b aa 1 2 3 4 5 6 (1, babaa) ({1}, babaa) (3, abaa) ({3}, abaa) (3, baa)(4, baa) ({3,4}, baa) (3, aa)(5, aa)({3,5}, aa) (3, a)(4, a) ({3,4}, a) (3, )(4, ) (6, ) ({3,4,6}, )

Download ppt "Why the algorithm works! Converting an NFA into an FSA."

Similar presentations

Complexity and Computability Theory I Lecture #4 Rina Zviel-Girshin Leah Epstein Winter 2002-2003.

Complexity and Computability Theory I Lecture #4 Rina Zviel-Girshin Leah Epstein Winter
1 Module 20 NFA’s with -transitions –NFA- ’s Formal definition Simplifies construction –LNFA- –Showing LNFA  is a subset of LNFA (extra credit) and therefore.

1 Module 20 NFA’s with -transitions –NFA- ’s Formal definition Simplifies construction –LNFA- –Showing LNFA  is a subset of LNFA (extra credit) and therefore.
Pushdown Automata Part II: PDAs and CFG Chapter 12.

Pushdown Automata Part II: PDAs and CFG Chapter 12.
Finite Automata and Non Determinism

Finite Automata and Non Determinism
1 Module 15 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA –Comparing LFSA to set of solvable languages (REC)

1 Module 15 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA –Comparing LFSA to set of solvable languages (REC)
1 Lecture 14 Language class LFSA –Study limits of what can be done with FSA’s –Closure Properties –Comparing to other language classes.

1 Lecture 14 Language class LFSA –Study limits of what can be done with FSA’s –Closure Properties –Comparing to other language classes.
1 Module 19 LNFA subset of LFSA –Theorem 4.1 on page 131 of Martin textbook –Compare with set closure proofs Main idea –A state in FSA represents a set.

1 Module 19 LNFA subset of LFSA –Theorem 4.1 on page 131 of Martin textbook –Compare with set closure proofs Main idea –A state in FSA represents a set.
1 Module 21 Closure Properties for LFSA using NFA’s –From now on, when I say NFA, I mean any NFA including an NFA- unless I add a specific restriction.

1 Module 21 Closure Properties for LFSA using NFA’s –From now on, when I say NFA, I mean any NFA including an NFA- unless I add a specific restriction.
Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.

Finite Automata Finite-state machine with no output. FA consists of States, Transitions between states FA is a 5-tuple Example! A string x is recognized.
Why the algorithm works! Simulating 2 FSA’s with 1 FSA.

Why the algorithm works! Simulating 2 FSA’s with 1 FSA.
Simulating 2 FSA’s with 1 FSA. Purpose This presentation presents an example execution of the algorithm which takes as input two FSA’s and produces as.

Simulating 2 FSA’s with 1 FSA. Purpose This presentation presents an example execution of the algorithm which takes as input two FSA’s and produces as.
1 Lecture 13 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA.

1 Lecture 13 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA.
1 Lecture 20 Regular languages are a subset of LFSA –algorithm for converting any regular expression into an equivalent NFA –Builds on existing algorithms.

1 Lecture 20 Regular languages are a subset of LFSA –algorithm for converting any regular expression into an equivalent NFA –Builds on existing algorithms.
1 Lecture 26 Decision problems about regular languages –Basic problems are solvable halting, accepting, and emptiness problems –Solvability of other problems.

1 Lecture 26 Decision problems about regular languages –Basic problems are solvable halting, accepting, and emptiness problems –Solvability of other problems.
Why the algorithm works! Simulating 2 FSA’s with 1 FSA.

Why the algorithm works! Simulating 2 FSA’s with 1 FSA.
Princeton University COS 226 Algorithms and Data Structures Spring 2003 Knuth-Morris-Pratt Reference: Chapter 19, Algorithms.

Princeton University COS 226 Algorithms and Data Structures Spring Knuth-Morris-Pratt Reference: Chapter 19, Algorithms.
1 Lecture 16 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA –Comparing LFSA to set of solvable languages (REC)

1 Lecture 16 FSA’s –Defining FSA’s –Computing with FSA’s Defining L(M) –Defining language class LFSA –Comparing LFSA to set of solvable languages (REC)
1 Module 18 NFA’s –nondeterministic transition functions computations are trees, not paths –L(M) and LNFA LFSA subset of LNFA –Comparing computational.

1 Module 18 NFA’s –nondeterministic transition functions computations are trees, not paths –L(M) and LNFA LFSA subset of LNFA –Comparing computational.
Regular Expression to NFA-  (a+ba) * a. First Parsing Step concatenate (a+ba) * a.

Regular Expression to NFA-  (a+ba) * a. First Parsing Step concatenate (a+ba) * a.
Lecture 18 NFA’s with -transitions –NFA- ’s Formal definition Simplifies construction –LNFA- –Showing LNFA  is a subset of LNFA and therefore a subset.

Lecture 18 NFA’s with -transitions –NFA- ’s Formal definition Simplifies construction –LNFA- –Showing LNFA  is a subset of LNFA and therefore a subset.

Similar presentations

Ads by Google