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.

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

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

Looking for Something at Site? Search Below

Dear Student

 

GDB Topic will be given to you on 6th and 7th of February 2019. Be ready for that. 

 

                                                          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".  


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

Replies to This Discussion

Theory of Automata CS402 GDB Idea are https://bit.ly/2MKI4aL

gdb solution plz

Please Discuss here about this GDB.Thanks

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

 

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

Or visit this link 

Click Here For Detail.

&

.•°How to Download past papers from study groups°•.

 

Please Click on the below link to see…

.... How to Find Your Subject Study Group & Join .... 

 

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

"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".  

Solution:

Context Free languages (CFLs) are languages that are recognized by Context Free Grammars, i.e., grammars whose production rules are of the form N → (N  Σ)⇤. They are also languages that are recognized by a type of machine called Pushdown automata.

Pushdown Automata (PDA) is the machine format of context free language (CFL). It is one type of finite state machine (FSM) which is used to accept only CFLs.

Solution:


Context Free languages (CFLs) are languages that are recognized by Context Free Grammars, i.e., grammars whose production rules are of the form N → (N ∪ Σ)⇤. They are also languages that are recognized by a type of machine called Pushdown automata.

Pushdown Automata (PDA) is the machine format of context free language (CFL). It is one type of finite state machine (FSM) which is used to accept only CFLs.

Mani Siddiqui BS VI  thanks for sharing :-) 

RSS

HELP SUPPORT

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

Today Top Members 

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

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

.