This presentation is the property of its rightful owner.
1 / 21

# Simulating 2 FSA’s with 1 FSA PowerPoint PPT Presentation

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 output an FSA which “simulates” both input FSA’s on any input string Algorithm Specification Input: FSA’s M 1 and M 2 Output: FSA M 3.

Simulating 2 FSA’s with 1 FSA

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

## 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 output an FSA which “simulates” both input FSA’s on any input string

• Algorithm Specification

• Input: FSA’s M1 and M2

• Output: FSA M3

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

M1

M2

a,b

b

a

b

a

### Initialization

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

The initial state of the output FSA M3 is the ordered pair of the initial states of M1 and M2.

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

b

a

b

a

a,b

a

a

b

B

I

II

a

A

D

b

b

III

C

a,b

a

a

a,b

b

b

B

I

II

a

a

b

a

A

D

b

b

III

C

### Determining Final States

Set Intersection

Both input machines should accept in order for new machine to accept

The one accepting state of the new machine M3 is I,D

Set Union

If either input machine accepts, new machine should accept

The six accepting states of the new machine M3 are I,A; I,C; I,B; II,D; III,D; I,D

Set Difference:

M1 should accept but M2 should not

The three accepting states of the new machine M3 are I,A; I,C; I,B

Symmetric Difference:

M1 should accept but M2 should not or M2 should accept but M1 should not

The five accepting states of the new machine M3 are I,A; I,C; I,B; II,D; III,D