GATE | GATE CS 2008 | Question 30

Let fsa and pda be two predicates such that fsa(x) means x is a finite state automaton, and pda(y) means that y is a pushdown automaton. Let equivalent be another predicate such that equivalent (a, b) means a and b are equivalent. Which of the following first order logic statements represents the following:

Each finite state automaton has an equivalent pushdown automaton.

q31
(A) A
(B) B
(C) C
(D) D



Answer: (A)
Explanation: Considering each option :

(A) If everything is a FSA, then there exists an equivalent PDA for everything.

(B) It is not the case that for all y if there exist a FSA then it has an equivalent PDA.

(C) Everything is a FSA and has an equivalent PDA.

(D) Everything is a PDA and has exist an equivalent FSA.

Thus, option (A) is correct.

Please comment below if you find anything wrong in the above post.

Quiz of this Question



My Personal Notes arrow_drop_up


Article Tags :

Be the First to upvote.


Please write to us at contribute@geeksforgeeks.org to report any issue with the above content.