# CS402 Assignment 2 Solution 2021 - Theory of Automata Assignment

If you are looking at CS402 Assignment 2 Solution 2021. Here we provide CS402 Assignment 2 Solution Spring 2021. View your solution and Download your CS402 assignment.

CS402 ASSIGNMENT 2 SOLUTION SPRING 2021

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:

 Old state A B -X,1=z1 Y,2=z2 X,1=z1 +Y,2=z2 Y,2=z2 X,3=z3 +X,3=z3 Y,3=z4 X,3=z3 +Y,3=z4 Y,3=z4 X,3=z3

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=

Make sure you can make some changes to your solution file before submitting copy-paste solution will be marked zero.

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.

CS402 Assignment 2 solution 2021
CS402 Assignment 2 solution spring 2021