QUESTION3 For some reason, my friend doesn\'t like odd numbers. Suppose he want
ID: 3916215 • Letter: Q
Question
QUESTION3 For some reason, my friend doesn't like odd numbers. Suppose he want every accepting computation of every string to consist of an even number of transitions call machines that have this property EPDAs. If a computation enters an accept state and has read all of the input, the machine may still not accept because there possibly have been an odd number of transitions applied. What is the relation between the class of languages PDAs recognize and those that EPDAs recognize? O They are exactly the same. O They have no languages in common. O Every language a PDA recognizes, a EPDA also recognizes, but not vice versa. O Every language a EPDA recognizes, a PDA also recognizes, but not vice versa. O There are languages in common, but some languages a PDA can recognize and a EPDA cannot, and vice versa. QUESTION 4 In the conversion of a PDA with n states to a CFG, the number of rules created of the third type(i.e., the rules that are created based on what is done with the PDA's stack), without doing any simplifications, is: O Constant independent of n O(n) but not a constant independent of n OO(n but not O(n2) O Not O(n3) Impossible to classify without more informationExplanation / Answer
Question 3. Option D is true.
Which is "Every language EPDA recognize are recognized by PDA"
It is because EPDA will be accepting only those strings which are in the language and also came to an end with even number of transitions but our PDA will accept those languages which are in the language irrespective of the fact that whether they are odd or not.