We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
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 |
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 CS402@vu.edu.pk
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] |
||
|
Tags:
+ How to Follow the New Added Discussions at Your Mail Address?
+ How to Join Subject Study Groups & Get Helping Material? + How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators? + VU Students Reserves The Right to Delete Your Profile, If?.
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)+ http://bit.ly/papersvu (Link 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)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)
***
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)
CS402-Assignment-1-Solution-Fall-2019_VU_Ning
link below
CS402 Assignment 1 Complete & Correct Solution Fall 2019
with Full Explanations
✧Foodie✧ Direct link allowed nai hai .... kitni bar ap ku bata chuka hun ...
********
CS402_Solution_Assignment_01_Fall_2019_Ning
see the below link
© 2019 Created by + M.Tariq Malik.
Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
VU Students reserves the right to delete profile, which does not show any Activity at site nor has not activity more than 01 month.
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post