fbpx
Share:

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.

[Solved] CS402 Assignment 1 Solution Fall 2019  

  RSS

admin
(@admin)
Admin
Joined: 1 year ago
Posts: 2
November 8, 2019 10:04 pm  

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:

  1. You should consult the recommended books, PowerPoint slides and audio lectures to clarify your concepts.
  2. 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.
  3. 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 [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]

 


Quote
admin
(@admin)
Admin
Joined: 1 year ago
Posts: 2
November 8, 2019 10:05 pm  

CS402 Theory of Automata Assignment 1 Solution Fall 2019


 

Students having same subject can start discussion here to Solve assignment quiz and can clear their concepts until solution is provided. 🖐️


ReplyQuote
amna sharif
(@amna-sharif)
New Member
Joined: 2 weeks ago
Posts: 1
November 11, 2019 10:16 am  

solution send me pleasa


ReplyQuote
kashglow
(@kashglow)
New Member
Joined: 2 weeks ago
Posts: 1
November 11, 2019 9:46 pm  

help please upload the solution 


ReplyQuote
admin
(@admin)
Admin
Joined: 1 year ago
Posts: 2
November 11, 2019 10:00 pm  

CS402 Theory of Automata Assignment 1 Solution Fall 2019


@amna-sharif

@kashglow

 

Download attachment for solution idea file.


ReplyQuote
admin
(@admin)
Admin
Joined: 1 year ago
Posts: 2
November 12, 2019 10:38 pm  

CS402 Theory of Automata Assignment 1 Solution Fall 2019


 

Another solution idea !


ReplyQuote
Share:

Please Login or Register