Multiple Choice
Fred created a new automaton model which is a push down automaton but with two stacks and the added ability of having commands which do not read input tape but which can pop from one stack and push into the other.This new automaton can recognize (choose strongest result)
A) Context Free Language
B) Context sensitive language
C) Regular language
D) Languages recognizable by Turing machine
Correct Answer:

Verified
Correct Answer:
Verified
Q4: The Family of recursive language is not
Q5: Recursive languages are<br>A)A proper superset of CFL<br>B)Always
Q6: The logic of pumping lemma is a
Q7: Let L be a language defined over
Q8: Which of the following statements is wrong?<br>A)The
Q10: If a language is denoted by a
Q11: Grammar that produce more than one Parse
Q12: Consider the following problem x. Given a
Q13: Which of the following problems is undecidable?<br>A)Membership
Q14: Let L denotes the language generated by