MCQOPTIONS
Bookmark
Saved Bookmarks
→
Automata Theory
→
Non Deterministic Turing Machines
→
A->aA| a| bThe number of steps to form aab:
1.
A->aA| a| bThe number of steps to form aab:
A.
2
B.
3
C.
4
D.
5
Answer» C. 4
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
Which of the following statements are correct for a concept called inherent ambiguity in CFL?
Choose the correct option:Statement 1: Recursive Inference, using productions from head to body.
Choose the correct option:Statement: There exists two inference approaches: Recursive Inference & Derivation
Which of the following the given language belongs to?L={ambmcm| m>=1}
Which among the following is the correct option for the given grammar?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.L(G)={w in T*|S *w}
A->aA| a| bThe number of steps to form aab:
Is the following statement correct?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:
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply