Replies to This Discussion

Permalink Reply by Irfan Khan (Chief Admin) on September 8, 2012 at 1:55am

Theory of Automata (CS402)

Assignment # 6 (Solution)

 

  Total marks = 20

                                                                                       Deadline Date = Expired

 

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. Convert the following FA into equivalent PDA.

                                                                                                                        [Marks 7]

Solution:

 

 

Q2. For which type of languages we must use Push and Pop in their corresponding PDA’s?

                                                                                                                        [Marks 3]

Answer:

 

Push and Pop states are used in PDAs when we are dealing with non-regular languages.

 

 

Q3. Construct a PDA that accepts the language of aⁿbⁿ⁺².

[Marks 10]

Solution:

 

Attachments:

• Spring 2012_CS402_6_SOL by www.virtualians.pk.rar, 117 KB