CS402 Assignment No 3 Solution Spring 2019

CS402 Assignment No 3 Spring 2019

Dear Students, Here you can read or Download CS402 - Theory of Automata Assignment No 3 Solution of Spring 2019. CS402 Assignment Due Date is 23 July, 2019. Total Marks are 20. We are here to facilitate your learning and we do not appreciate the idea of copying or replicating solutions. CS402 Assignment Solution File has been added below. Previously we shared CS403 Assignment No 3 Solution Spring 2019.

CS402 Assignment Objectives:

Objective of this assignment is to assess the understanding of students aboutthe concept of languages, regular expressions, and finite automata and GTG.

CS402 Assignment Instructions:

Please read the following instructions carefully before submitting the 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 the due date.
The assignment is copied from the Internet or from any other student.
The submitted assignment does not open or file is corrupt.

Assignment Question No 1:

As we know that if two languages (L1 & L2) are Regular Languages then L1 ∩L2 is also regular.

You have given two regular languages L1 & L2, defined over the alphabet ∑= {a,b}

L1= language of words having triple a’s.

L2= language of words containing ab.

According to these two languages, you need to provide a step by step solution for L1 ∩L2 using De-Morgan’s Law.