Theory of Automata (CS402)
Assignment # 5
Total marks = 20
Deadline Date = June 19, 2012
Please carefully read the following instructions before attempting the assignment.
Rules for Marking
It should be clear that your assignment would not get any credit if:
- The assignment is submitted after due date.
- The submitted assignment does not open or file is corrupt.
- The assignment is copied.
Note that strict action would be taken if the submitted assignment is copied from any other student. Both students will be punished severely.
1) You should concern recommended books to clarify your concepts as handouts are not sufficient.
2) You are supposed to submit your assignment in .doc format. Any other formats like scan images, PDF, Zip, rar, bmp etc will not be accepted.
3) You are advised to upload your assignment at least two days before Due date.
Important Note:
Assignment comprises of 20 Marks. Note that no assignment will be accepted after due date via email in any case (whether it is the case of load shedding or emergency electric failure or internet malfunctioning etc.). Hence, refrain from uploading assignment in the last hour of the deadline, and try to upload Solutions at least 02 days before the deadline to avoid inconvenience later on.
For any query please contact: CS402@vu.edu.pk
Q1. Write down CFG of a language in which the number of 1’s are greater than 0’s defined over an alphabet set {0,1}. Marks [7]
Q2. Make a CFG corresponding to the following RE:
ab*(a+b)* b + ba*(a+b)*a Marks [7]
Q3. Sà aSb | bSa | SS | ^
Show that the given grammar is ambiguous by running “abab” and creating any of its two different parse trees. Marks [6]
No comments:
Post a Comment