Dear Students! Please share your Assignment files as you recieve in your lms so it can be discussed/solved timely. Share assignments files by click on UPLOAD button.
CS402 Theory of Automata Assignment 1 Solution Fall 2019
Assignment No. 01 
Total Marks: 20 Due Date: November 15, 2019 

Objectives: Objective of this assignment is to assess the understanding of students about the concept of languages, regular expressions and finite automata. 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 [email protected]
Question: Marks = 20 Q1. Show that the following pairs of regular expressions define the same language over the alphabet
L = {a, b}.
(i) (ab)*a and a(ba)* (ii) (a* + b)* and (a + b)* (iii) (a* + b*)* and (a + b)* [9 marks = 3*3] Q2. Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings in which the letter b is never tripled. This means that no word contains the substring bbb. [5 marks]
Q3. Develop a regular expression for the following language over the alphabet P = {a, b} such that it accepts all strings all words in which a is tripled or b is tripled, but not both. This means each word contains the substring aaa or the substring bbb but not both. [ 6 marks] 


CS402 Theory of Automata Assignment 1 Solution Fall 2019
Download attachment for solution idea file.
CS402 Theory of Automata Assignment 1 Solution Fall 2019
Another solution idea !