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.
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.
Attention reader! Don’t stop learning now. Practice GATE exam well before the actual exam with the subject-wise and overall quizzes available in GATE Test Series Course.
Learn all GATE CS concepts with Free Live Classes on our youtube channel.