CS402 Assignment No. 02 Final Solution
Assignment No. 02
Semester: Fall 2017 Theory of Automata – CS402 |
Total Marks: 15
Due Date: 16/01/2018
|
|
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.
Instructions:
Please read the following instructions
carefully before submitting assignment:
·
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.
Download Solution Here
|
||
BEST OF LUCK
|
||
