The language accepted by Push down Automaton: – McqOptions

MCQOPTIONS

1.	The language accepted by Push down Automaton:
A.	Recursive Language
B.	Context free language
C.	Linearly Bounded language
D.	All of the mentioned
Answer» C. Linearly Bounded language

Discussion

No Comment Found

Related MCQs

Which of the following statements are correct for a concept called inherent ambiguity in CFL?
Choose the correct option:<br>Statement 1: Recursive Inference, using productions from head to body.
Choose the correct option:<br>Statement: There exists two inference approaches: Recursive Inference & Derivation
Which of the following the given language belongs to?<br>L={a<sup>m</sup>b<sup>m</sup>c<sup>m</sup>| m>=1}
Which among the following is the correct option for the given grammar?<br>G->X111|G1,X->X0|00
The language accepted by Push down Automaton:
An expression is mentioned as follows. Figure out number of incorrect notations or symbols, such that a change in those could make the expression correct.<br>L(G)={w in T*|S *w}
A->aA| a| b<br>The number of steps to form aab:
Is the following statement correct?<br>Statement: Recursive inference and derivation are equivalent.
If w belongs to L(G), for some CFG, then w has a parse tree, which defines the syntactic structure of w. w could be: