.... How to Find Your Subject Study Group & Join ....   .... Find Your Subject Study Group & Join ....  

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

Study Groups By Subject code Wise (Click Below on your university link & Join Your Subject Group)

[ + VU Study Groups Subject Code Wise ]  [ + COMSATS Virtual Campus Study Groups Subject Code Wise ]

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

Assignment No. 02
Semester: Fall 2017
Theory of Automata – CS402


Total Marks: 15


Due Date: 16/01/2018



Objective of this assignment is to assess the understanding of students about the concept of complement of a language and intersection of two regular languages.



Please read the following instructions carefully before submitting assignment:

  1. You should consult the recommended books, PowerPoint slides and audio 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 cs402@vu.edu.pk



 Question No 1:                                                                                                              Marks:5+5+5=15

Consider the following two regular languages:


Let L1 be the language defined over alphabet ∑={a    b} that contains all strings starting with alphabet a. (Example strings abbababa, aaaab, abaabbbb)

Let L2 be the language defined over alphabet ∑={a    b} that contains all strings in which alphabet a comes in the string in even number. (Example strings aba, bbabaaab, abaabba)


Construct the corresponding FAs of above languages. Construct the transition table for the intersection of above regular languages and a corresponding transition diagram for (FA1∩FA2).


Hint: You may use short method for intersection of two regular languages.





Share This With Friends......

How to Find Your Subject Study Group & Join.

Find Your Subject Study Group & Join.

+ Click Here To Join also Our facebook study Group.

This Content Originally Published by a member of VU Students.

+ Prohibited Content On Site + Report a violation + Report an Issue

+ Safety Guidelines for New + Site FAQ & Rules + Safety Matters

+ Important for All Members Take a Look + Online Safety

Views: 6979

See Your Saved Posts Timeline


Replies to This Discussion

no it's right coz 2*3=6 so there should be 6 states

its means that the number of states in the intersection of two FAs will always

be equal to the prodct of states in each FA??


Assignment Questions share kr dai koi 

Complete Solution .doc file.Bs100401984%20CS%20402%20%23%202.docx



FA's math type mein bna skty hn???

no, use word Shape tools to draw FA etc.

FA's word mein koe share kr do

use jflap for making FA's


Forum Categorizes

Job's & Careers (Latest Jobs)

Admissions (Latest Admissons)

Scholarship (Latest Scholarships)

Internship (Latest Internships)

VU Study

Other Universities/Colleges/Schools Help

    ::::::::::: More Categorizes :::::::::::

Member of The Month

1. Angry Bird

Lahore, Pakistan

© 2018   Created by +~Malik~.   Powered by

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