GATE CSE 2008

Planning to take coaching on Unacademy http://bit.ly/gate_unacademy or https://unacademy.com/ here is a code for 10% off PLUS1BPK1 Telegram Notification Group link:- https://t.me/joinchat/X5egW_cvdt9kMGY1 Telegram discussion Group link:- https://t.me/joinchat/VCyGUmVq8RNkMzhl Downloads resources from here https://education4fun.com/gate-cse/ MCQ (Single Correct Answer) GATE CSE 2008 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. (∀x fsa(x))⟹(∃y pda(y)∧equivalent(x,y)) ¬∀y(∃x fsa(x)⟹pda(y)∧equivalent(x,y)) ∀x∃y(fsa(x)∧pda(y)∧equivalent(x,y)) ∀x∃y(fsa(y)∧pda(x)∧equivalent(x,y))