We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

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

CS402 GDB Spring 2019 Solution & Discussion

+ Click Here To Join also Our facebook study Group.

+ How to Join Subject Study Groups & Get Helping Material?

+ How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators?


See Your Saved Posts Timeline

Views: 1267

.

+ 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?)

Replies to This Discussion

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.

 

“How to Join Subject Study Groups & Get Helping Material”

 

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

 

 

http://bit.ly/vucodes (Assignments Solution, GDBs Solution & Online Quizzes)

http://bit.ly/papersvu (Past Papers, Solved MCQs, Short Notes & More)

Please send the solution of gdb cs402 ...............

(PDA is more powerful than FA also use 7 tuples so it can accept all languages that can be accepted by FA.

FA is weak than DFA also it use 5 tuples so it cannot accept all languages tha DFA can accept).  according to me this is right but not sure. 

Finite Automata (FA) and Push Down Automata (PDA) both are used to express the languages. The Finite Automata is deterministic and Push Down Automata is deterministic and as well as non-deterministic.
You are required to give comments on the following statements:
•           Whether the PDA accepts all the languages that have been accepted by the FA? Yes or No, explain in either case with an example.
Answer:
Yes:
As we know that FA`s deterministic and PDA`s are deterministic and non-deterministic as well. So it is very clear that languages which are accepted by FA`s will also be accepted by PDA`s. you can give examples of any regular language like language starting with and ending with different letters, language containing bb or aa

•           Whether the FA accepts all the languages that have been accepted by the PDA? Yes or No, explain in either case with an example.
Answer:
No:
As PDA`s are non-deterministic also but FA`s are not. so it is not possible for FA to accept all the languages which are accepted by PDA`s.there are non-regular languages which will be accepted by PDA`s e.g.Language of double factorial which can’t be accepted by FA. Hence statement is false.

CS402 GDB Solution Spring 2019

link 

CS402 GDB Solution Spring 2019

Cs402 gdb
a) Yes, as we know that FA’s are deterministic and PDA’s are deterministic and non-deterministic as well. So it is clear that languages which are accepted by FA’s will also be accepted by PDA’s. You can give examples of any regular language starting with and ending with different letters, languages containing bb or aa.

b) No, as PDA’s are non-deterministic also but FA’s are not. So it is not possible for FA to accept all the languages which are accepted by PDA’s. There are non-regular languages which will be accepted by PDA’s e.g. language of double factorial which cannot accepted by FA. Hence statement is false.

Cs402 gdb solution 2019
1st point yes 2nd point no

No photo description available.

RSS

Today Top Members 

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

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