We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion

How to Add New Discussion in Study Group ? Step By Step Guide Click Here.

Assignment No. 2 of CS402 has been uploaded. The due date to submit the assignment is July 14th, 2016

Assignment No. 02
Semester: Spring 2016
Theory of Automata – CS402


Total Marks: 20


Due Date:  14/07/2016



Objective of this assignment is to assess the understanding of students about:

  • Union of Regular Languages
  • Intersection of Regular Languages
  • Transition Table
  • Finite Automaton



Please read the following instructions carefully before submitting assignment:

  1. 1.     You should consult the recommended books, PowerPoint slides and video lectures to clarify your concepts.
  2. 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. 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 cs402@vu.edu.pk



Question 1:                                                                                                                                Marks:10   10

Consider the following FAs corresponding to regular languages L1 and L2, defined over the alphabet Σ = {a, b}.


FA1 corresponding to L1

FA2 corresponding to L2



You are required to draw a transition table for the FA corresponding to L1 ∩ L2.



Question 2:                                                                                                                               Marks: 10


Given the FAs corresponding to L1 and L2 in Question 1, you are required to draw an FA corresponding to L1c ∪ L2c.






+ How to Follow the New Added Discussions at Your Mail Address?

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?

+ VU Students Reserves The Right to Delete Your Profile, If?

See Your Saved Posts Timeline

Views: 4407


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here To Join (Our facebook study Group)


Replies to This Discussion

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions.


Anyone has sharing of 

  • Intersection of Regular Languages?????

cs402 Assignment no 2 practice notes  .find attachment


Answer of question 1 is not correct don't copy paste people in hurry. In Intersection you can rank final state if and only if when both states are at final. So, Question 1 wrongly developed mean wrong diagram as well. Give it a thought again. Instead of ready made solution I would like if this forum gives us the clue in right direction. Anyways, it's my personal opinion, with which anyone can differ.

then jo theek he wo btain mje yahi theek lg rha ...again na again check kiya yahi ata he

then give reasons?



Answer No 1:-          

            Transition Table for FA corresponding to L1 ∩ L2.


Old State



Z1- =1,X



Z2 =1,Y



Z­­­3 =2,X



­Z4 =2,Y

(1,Y)= Z2


Z5+ =3,X



Z6 =3,Y




Regular Expression is:




Answer No 2:


FA corresponding to L1c ∪ L2c.


ap ne first line main he z4 stage likhe .give reasons

bro ap ne first question main First main z4 kiyoon likha ye 2y=z2 ata he ??

and second question also has fault no arrangment

Dear Students Don’t wait for solution post your problems here and discuss ... after discussion a perfect solution will come in a result. So, Start it now, replies here give your comments according to your knowledge and understandings....

Check it 



Transition table




Old states

New states



-1,x =z1

1,x =z1

2,y =z2

2,y =z2

1,y =z3

3,x =z4

1,y =z3


2,x =z5

3,x =z4

3,x =z4

3,y =z6

+2,x =z5

1,x =z1

3,y =z6

3,y =z6

3,y =z6

3,x =z4


Today Top Members 

© 2020   Created by +M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service