+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
GDB Topic
Theory of automata is study of abstract machines, like Turing Machines, Finite State Machines, Push Down Automata, Mealy and Moore Machines. You have to discuss and explain which kind of automaton machine promisingly can serve as a recognizer for context-free languages.
Note:
A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 100 words.
Tags:
+ 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)Please Discuss here about this GDB.Thanks
Our main purpose here discussion not just Solution
Students having same subject can start discussion here to solve assignment, GDB & Quiz and can clear their concepts until solution is provided.
P.S: Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”
Then copy Questions from assignment file and paste in Discussion.
+ http://bit.ly/vucodes (For Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (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)
ha bhai kon c machine best hay to recognize context free languages...??? discuss and why ???
CS402 GDB IDEA
Answer
Push Down Automata
Reason
CS402 Theory of Automata GDB Solution & Discussion Fall 2019
CS402 GDB Solution Idea:
Turing machine can serve as a recognizer for context free language. Context free languages are described by context free grammars which can be generated by pushdown automata. Regular languages and finite state machines can describe some context free languages but not all. Turing machines can generate all regular languages all context free languages and more.
It shows that the Turning machine will be used. Turning machine is more powerful. Turning machine with an input tape and a working tape can emulate a push down automaton directly using the same number of steps. Turning machines can accept some non context free languages as well, in addition to context free languages.
A finite state machine cannot identify or recognize context free language at all. Push down automata and turning machine both can identify context free language but a turning machine can recognize context free language using few states or transition than a push down automata for the same language.
Another solution idea of CS402 GDB:
A finite state machine cannot identify or recognize Context free language at all. Push down automata (PDA) and Turing machine both can identify/recognize Context free language but a Turing machine can recognize context free language using few states or transition than a push down automata for the same language.
Turing machine is more powerful, Turing machine with an input tape and a working tape can emulate a pushdown automaton directly, using the same number of steps. Turing machines can accept some non- Context free languages as well, in addition to Context free languages.
© 2021 Created by + M.Tariq Malik.
Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
We have been working very hard since 2009 to facilitate in learning Read More. We can't keep up without your support. Donate.
We are user-generated contents site. All product, videos, pictures & others contents on site don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post