CS402 Assignment No 2 Solution Fall 2017

CS402 Assignment No 2 Fall 2017

Dear Students, Here you can read or Download CS402 - Theory of Automata Assignment No 2 Solution and Discussion of Semester Fall 2017. Assignment Due Date is 16th January, 2018. Total Marks are 15. CS402 Assignment Solution has been added. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. Previously we shared CS402 Assignment no 1 Solution Fall 2017.

CS402 Assignment No 2 Solution fall 2017

CS402 Assignment Objectives:

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.

CS402 Assignment Instructions:

Please read the following instructions carefully before submitting assignment:

You should consult the recommended books, PowerPoint slides and audio lectures to clarify your concepts.

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.

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.

Please 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

CS402 Assignment 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.