Multiple Choice
The language accepted by a Push down Automata:
A) Type 0
B) Type 1
C) Type 2
D) Type 3
Correct Answer:
Verified
Correct Answer:
Verified
Related Questions
Q23: What is the highest type number which
Q24: TM is more powerful than FSM because<br>A)The
Q25: Let L<sub>1</sub> be a recursive language. Let
Q26: If L and L¯ are recursively enumerable,
Q27: Which of the following statement is wrong?<br>A)Any
Q29: For two regular languages L<sub>1</sub> = (a
Q30: Which statement is true?<br>A)The PDA must have
Q31: Which of the following problem is undecidable?<br>A)Membership
Q32: The following CFG is in S ?
Q33: Pumping lemma is generally used for proving