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

Dear Students,

Graded discussion (GDB) will be launched on Thursday 9th August, 2018 and it will remain open for two days. You can post your comments on the below mentioned topic till Friday 10th August, 2018.

Theory of automata is the study of abstract machines, as well as learning of computational problems that can be solved using them. It is a theory in theoretical computer science and discrete mathematics (a subject of study in both mathematics and computer science).  It is considered to be the study of machines like Turing machine, Finite state machine, Pushdown Automata etc. By keeping in mind the concepts of automata, you have to elaborate the role of Push down Automata (PDA) and Turing Machine in Formal Language Processing and which one is better in both to them? Justify your answer with proper reason.  

Instructions for Posting GDB Comments 

  1. You need to provide precise and to the point answer, avoid irrelevant details.
  2.  Copy from the internet or other student will get zero marks.
  3.   You should post your answer on the Graded Discussion Board (GDB), not on the Moderated Discussion Board (MDB). Both will run parallel to each other during the specified time. Therefore, due care will be needed.
  4.   You need to use font style as “Times New Roman” and font size 12.
  5.  You cannot participate in the discussion after the due date via email.
  6.   The GDB will open and close on specified date and time. Please note that no grace day or extra time will be given for posting comments on GDB.

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

Replies to This Discussion

#Cs402 Idea By me..  share if its wrong  #title is by mistake i print 


CS402 GDB Solution 10 Aug 2018


GDB Solution is here https://bit.ly/2OWTQzx

discussion idea

I've came up with a result while reading some automata books, that Turing machines appear to be more powerful than pushdown automata. Since the tape of a Turing machine can always be made to behave like a stack, it'd seem that we can actually claim that TMs are more better.

TM is Better Than PDA.

CS402 GDB Solution 10 Aug 2018

Please don't depend on copy paste make some changes..


CS402 GDB Solution 10 Aug 2018

Please don't depend on copy paste;;



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