CS402 ASSIGNMENT 2 SOLUTION SPRING 2021

**DOWNLOAD SOLUTION FILE BELOW**

Question No 1:

Let FA1:

And FA2:

Construct an FA3 defining the UNION of FA1 and FA2. Also, write the regular expression for FA3.

Note: Only FA is required here, not the transition table.

Solution:

Fa3

DIAGRAM:

Question No 2:

Construct a regular expression and Transition Graph (TG) defining the following language over ∑={x,y}:

All strings of x’s and y’s having y, x, and y as a subsequence.

SOLUTION:

R.E=

T. G=

PLEASE NOTE:

Don't copy-paste the same answer.

If you found any mistake then correct yourself and inform me.

Before submitting an assignment check your assignment requirement file.

If you need some help and question about file and solutions.

## 0 Comments