Presentation is loading. Please wait.

Presentation is loading. Please wait.

Why the algorithm works! Simulating 2 FSA’s with 1 FSA.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "Why the algorithm works! Simulating 2 FSA’s with 1 FSA."— Presentation transcript:

1 Why the algorithm works! Simulating 2 FSA’s with 1 FSA

2 Purpose This presentation attempts to give the reader some intuition as to why the algorithm which takes as input two FSA’s and produces as output an FSA which “simulates” both input FSA’s on any input string works correctly. We use the example from the previous presentation to illustrate this intuition.

3 Why the Transformation Works a b b b a a I III II a,b a a b b A B C D M1M1 M2M2 Constructed FSA

4 Key Idea a b b b a a I III II a,b a a b b A B C D M1M1 M2M2 Constructed FSA In all configurations, the pair of states that M 1 and M 2 are in is exactly the state that the constructed FSA is in.

5 Initial Configurations a b b b a a I III II a,b a a b b A B C D I,[1,abbb] A,[1,abbb](I,A),[1,abbb]

6 Second Configurations a b b b a a I III II a,b a a b b A B C D I,[1,abbb] A,[1,abbb](I,A),[1,abbb] I,[2,abbb] C,[2,abbb](I,C),[2,abbb]

7 Third Configurations a b b b a a I III II a,b a a b b A B C D I,[1,abbb] A,[1,abbb](I,A),[1,abbb] I,[2,abbb] C,[2,abbb](I,C),[2,abbb] II,[3,abbb]D,[3,abbb](II,D),[3,abbb]

8 Fourth Configurations a b b b a a I III II a,b a a b b A B C D I,[1,abbb] A,[1,abbb](I,A),[1,abbb] I,[2,abbb] C,[2,abbb](I,C),[2,abbb] II,[3,abbb]D,[3,abbb](II,D),[3,abbb] III,[4,abbb]D,[4,abbb](III,D),[4,abbb]

9 Final Configurations a b b b a a I III II a,b a a b b A B C D I,[1,abbb] A,[1,abbb](I,A),[1,abbb] I,[2,abbb] C,[2,abbb](I,C),[2,abbb] II,[3,abbb]D,[3,abbb](II,D),[3,abbb] III,[4,abbb]D,[4,abbb](III,D),[4,abbb] I,[5,abbb]D,[5,abbb](I,D),[5,abbb]

10 Determining Acceptance a b b b a a I III II a,b a a b b A B C D I,[5,abbb]D,[5,abbb](I,D),[5,abbb] The input string abbb is accepted by both input FSA’s. Thus, if the constructed FSA is designed to accept the set intersection or set union of the two languages accepted by the two input FSA’s, the constructed FSA should accept the input string abbb. If the constructed FSA is designed to accept the set difference or symmetric difference of the two languages accepted by the two input FSA’s, it should reject the input string abbb.

Download ppt "Why the algorithm works! Simulating 2 FSA’s with 1 FSA."

Similar presentations

Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.

Recognising Languages We will tackle the problem of defining languages by considering how we could recognise them. Problem: Is there a method of recognising.
1 Lecture 32 Closure Properties for CFL’s –Kleene Closure construction examples proof of correctness –Others covered less thoroughly in lecture union,

1 Lecture 32 Closure Properties for CFL’s –Kleene Closure construction examples proof of correctness –Others covered less thoroughly in lecture union,
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.
Theory Of Automata By Dr. MM Alam

Theory Of Automata By Dr. MM Alam
1 Regular Expressions and Automata September 10 2009 Lecture #2-2.

1 Regular Expressions and Automata September Lecture #2-2.
Lecture 3UofH - COSC 3340 - Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 3.

Lecture 3UofH - COSC Dr. Verma 1 COSC 3340: Introduction to Theory of Computation University of Houston Dr. Verma Lecture 3.
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)
Lecture 9 Recursive and r.e. language classes

Lecture 9 Recursive and r.e. 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 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.
Homework 8 Solutions #1 True or False a) Regular languages are recursive b) Context free languages are recursively enumerable (r.e.) c) Recursive languages.

Homework 8 Solutions #1 True or False a) Regular languages are recursive b) Context free languages are recursively enumerable (r.e.) c) Recursive languages.
Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.

Fall 2004COMP 3351 Recursively Enumerable and Recursive Languages.
1 Module 9 Recursive and r.e. language classes –representing solvable and half-solvable problems Proofs of closure properties –for the set of recursive.

1 Module 9 Recursive and r.e. language classes –representing solvable and half-solvable problems Proofs of closure properties –for the set of recursive.
FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY 15-453.

FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
Lecture 8 Recursively enumerable (r.e.) languages

Lecture 8 Recursively enumerable (r.e.) languages
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.
Why the algorithm works! Converting an NFA into an FSA.

Why the algorithm works! Converting an NFA into an FSA.
1 Module 16 Distinguishability –Definition –Help in designing/debugging FSA’s.

1 Module 16 Distinguishability –Definition –Help in designing/debugging FSA’s.
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.

Similar presentations

Ads by Google