Gate CS-2008 Question Paper With Solutions

Q. 54 Let fsa and pda be two predicates such that fsa(x) means x is a finite state
automation, and pda(y) means, that y is a pushdown automation. Let equivalent
be another predicate such that equivalent (a,b) means aa and b are equivalent.
Which of the following first order logic statement represents the following:
Each finite state automation has an equivalent pushdown automation.

Gate CS-2008 Question Paper With Solutions

Answer: (A)

Explanation:

Gate CS-2008 Question Paper With Solutions

Learn More:   Gate EC-2016 - 3 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here