Scribd
Upload
162 views5 pages

CS402 Assignment Solution

This document provides instructions for Assignment No. 02 for the Theory of Automata course. It includes objectives to assess understanding of sequential circuits, concatenation of transition graphs, complements of finite automata, Myhill-Nerode theorem, and language prefixes. Students are instructed to submit assignments in .doc format before the August 24 deadline. The assignment contains two questions - the first asks to find new states and outputs for a sequential circuit and the concatenation of two transition graphs, while the second proves a language is regular using Myhill-Nerode theorem and finds the prefixes of one language that are contained in another.

Uploaded by

Saba Shaheen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
162 views5 pages

CS402 Assignment Solution

This document provides instructions for Assignment No. 02 for the Theory of Automata course. It includes objectives to assess understanding of sequential circuits, concatenation of transition graphs, complements of finite automata, Myhill-Nerode theorem, and language prefixes. Students are instructed to submit assignments in .doc format before the August 24 deadline. The assignment contains two questions - the first asks to find new states and outputs for a sequential circuit and the concatenation of two transition graphs, while the second proves a language is regular using Myhill-Nerode theorem and finds the prefixes of one language that are contained in another.

Uploaded by

Saba Shaheen
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment No.

02
Semester: Spring 2022
Total Marks: 20
Theory of Automata – CS402

Deadline Date:
August 24, 20222

Objectives:
To assess the understanding of students about the concepts of: 
 Sequential Circuit
 Concatenation of TGs
 Complement of FA
 Myhill Nerode theorem 
 Prefix of language

Instructions:
Please read the following instructions carefully before submitting assignment:
1. You should consult the recommended books, handouts, PowerPoint slides and video
lectures to clarify your concepts.
2. You are supposed to submit your assignment in .doc format. Any other formats like
scan images, PDF, zip, rar and bmp etc will not be accepted. 
3. It should be clear that your assignment will not get any credit if:
 The assignment is submitted after due date.
 The assignment is copied from Internet or from any other student.
 The submitted assignment does not open or file is corrupt.

Note: No assignment will be accepted after the due date through email in any case (load
shedding, server down, internet malfunctioning etc.). 
It is recommended to upload solution file at least two days before its closing date.

For any query about the assignment, contact at [email protected]


Question: 1                                                                                           Marks =3+3+4 3
a. Consider the following sequential circuit.

If
Input=1
Old A= 0
Old B= 1
Then find:
1. New Value of A
2. New Value of B
3. Value of Output
Solution:
New Value of B = old A = 0
New A = (input) XOR (old A OR old B)
= (1) XOR (0 OR 1)
= 1 XOR 1
New value of A = 0
Output = (Input) AND (OLD B)
= 1 AND 1
=1

b. Consider the following TG1 and TG2 and find the resultant TGr which is equal to the
concatenation of TG1 and TG2.
TG1
TG2

Solution:

c. Find the complement of the following FA:


Solution:

Question, 2:                                                                                            Marks =5+5 

a. Prove by Myhill Nerode theorem that the following language is regular or non-
regular.  
        The language L defined over Σ = {u, v} in which all the strings ends with v.

Solution:
It can be observed that L partitions into the following two classes
C1=set of all string ending in v
C2=set of all string not ending in v
Since there are finite many classes generated by L is regular.

b. Let T = {xx, xyxxxyy, yyxxxxx, yyyyyyyyyy} U = {y, yyyy, yyyxxx, yyyxxxxx,


xyxxxyyxx, xyyxxyyyxx} 
            Then find pref (T in U).
Solution: Pref(T in U) = {y, xyxxxyy, yyyx, yyyxxx}
BEST OF LUCK

You might also like