We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.


+ Link For Assignments, GDBs & Online Quizzes Solution


+ Link For Past Papers, Solved MCQs, Short Notes & More

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


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


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 CS402@vu.edu.pk


Question:                                                                                                              Marks = 20

Q1. Show that the following pairs of regular expressions define the same language over the alphabet


= {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]


+ 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)

Views: 4016

Replies to This Discussion

CS402 Assignment # 1 FALL 2019 COMPLETE SOLUTION


Looking For Something? Search Below

© 2021   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service