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


+ Link For Assignments, GDBs & Online Quizzes Solution


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

CS402 Theory of Automata Assignment#05 Solution & Discussion Due Date: 07-07-2011

Theory of Automata (CS402)

Assignment No.5



Your assignment must be uploaded before or on 7th July, 2011 [Try to upload your solution well before due date to avoid any issue] 


Rules for Marking


It should be clear that your assignment will not get any credit if:

  • The assignment is submitted after due date
  • The assignment is copied



Objective of this assignment is to make students able to understand the following concepts,


  • CNF
  • PDA


Question No.1


Convert the CFG (Context Free Grammar) given below to CNF (Chomsky Normal Form)



Question No.2


Design Push Down Automata (PDA) for


(ba)n(ab)n                  n = 1,2,3…




You can push single a on reading ‘ba’ (in loop) and once you get ‘a’ again after reading ‘ba’ start popping pushed a’s against each occurrence of ‘ab’ . You will move to accept state if you have empty stack (∆ on pop) on finish of input string (reading ∆)





Assignment Uploading Instructions:

Upload single word file in word 2003 format having solutions for all questions.

+ 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: 278

Replies to This Discussion

Please Discuss here about this assignment.Thanks

yes please some one help us we are already busy to study the final term exam metrial
yes you are right
Lagta hey mjhe he solution upload krna pre ga..............
Question No.1 CNF
Convert the CFG (Context Free Grammar) given below to CNF (Chomsky Normal Form)
To convert the above CFG to be in CNF, introduce the new productions as
X --> xxy, Y --> Xw then the new CFG will be.

S --> XYX
X --> XXY
Y --> XW

Introduce non- terminals so that,

S -->XR1
R1 -->YX
X --> XR2
R2 --> XY
Y --> XW
X --> xxy
Y --> Xw
what about second question
See the attached file for one more idea solution of CS402 Assignment#05 Spring 2011

Read more: CS402 - Theory of Automata ASSIGNMENT # 05 Solution - Virtual Unive... http://vustudents.ning.com/group/cs402theoryofautomata/forum/topics...


Looking For Something? Search Here


This is a member-supported website. Your contribution is greatly appreciated!

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

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