CS402 Assignment No 01 Fall 2019 Solution & Discussion Due Date: 15-11-2019

[+ M.Tariq Malik]

CS402 Assignment No 01 Fall 2019 Solution & Discussion Due Date: 15-11-2019

CS402 Theory of Automata Assignment 1 Solution Fall 2019

---

	Assignment No. 01 Semester: Fall 2019 Theory of Automata – CS402	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: 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.   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 [e-mail]   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]

[+ M.Tariq Malik]

Please Discuss here about this assignment.Thanks

Our main purpose here discussion not just Solution

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

Then copy Questions from assignment file and paste in Discussion.

 

+ http://bit.ly/vucodes (For Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (For Past Papers, Solved MCQs, Short Notes & More)

+ Click Here to Search (Looking For something at vustudents.ning.com?)

+ Click Here to Join (Our facebook study Group)

[+ M.Tariq Malik]

***

[+ M.Tariq Malik]

CS 402 Assignment 1 solution fall 2019

[+ M.Tariq Malik]

CS402 Assignment 1 Solution Fall 2019
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)*
Solution:
Since the strings generated by language (ab)*a and a(ba)* define the same strings ending in a hence both  RE define the same language.
Both RE define the same language of all string containing any number of a’s and b’s
Since (a* + b*)*  and (a + b)* generate all string containing any number of a’s and b’s hence both RE define the same  language.
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.
Answer: since we need to define RE for a language that have strings like {Λ, abb,abba, aabbaa,…}
Hence the RE for this language would be (a * +  bb)*   
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.
Answer: since we need to develop a RE for a language that have strings like {aaab, bbbaa, aaabb}
Hence the required RE for this language would be (aaa+ + b) + (bbb+ + a)

[+ M.Tariq Malik]

CS402-Assignment-1-Solution-Fall-2019_VU_Ning

link below 

CS402-Assignment-1-Solution-Fall-2019_VU_Ning

[✧Ｆｏｏｄｉｅ✧]

CS402 Assignment 1 Complete & Correct Solution Fall 2019

with Full Explanations

[+ M.Tariq Malik]

✧Ｆｏｏｄｉｅ✧ Direct link allowed nai hai .... kitni bar ap ku bata chuka hun ... 

[+ M.Tariq Malik]

CS402 One more solution

below link

CS402_Assignment#01_Solution_VU_Ning

[Mani Siddiqui Ex]

[+ M.Tariq Malik]

CS402 Assignment No 1 Solution Sample Preview Fall 2019 - Theory of Automata-1

[◄ Zohaib ►]

********

[+ M.Tariq Malik]

CS402_Solution_Assignment_01_Fall_2019_Ning

see the below link 

CS402_Solution_Assignment_01_Fall_2019_Ning