Explore topic-wise MCQs in Automata Theory.

This section includes 13 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory knowledge and support exam preparation. Choose a topic below to get started.

1.

Which of the following statements are correct for a concept called inherent ambiguity in CFL?

A. Every CFG for L is ambiguous
B. Every CFG for L is unambiguous
C. Every CFG is also regular
D. None of the mentioned
Answer» B. Every CFG for L is unambiguous
Discussion
2.

Choose the correct option:
Statement 1: Recursive Inference, using productions from head to body.

A. nStatement 2: Derivations, using productions from body to head.
B. Statement 1 is true and Statement 2 is true
C. Statement 1 and Statement 2, both are false
D. Statement 1 is true and Statement 2 is false
E. Statement 2 is true and Statement 1 is true
Answer» C. Statement 1 and Statement 2, both are false
Discussion
3.

Choose the correct option:
Statement: There exists two inference approaches: Recursive Inference & Derivation

A. true
B. partially true
C. false
D. none of the mentioned
Answer» B. partially true
Discussion
4.

Which of the following the given language belongs to?
L={ambmcm| m>=1}

A. Context free language
B. Regular language
C. Context free language & Regular language
D. None of the mentioned
Answer» E.
Discussion
5.

Which among the following is the correct option for the given grammar?
G->X111|G1,X->X0|00

A. {0<sup>a</sup>1<sup>b</sup>|a=2,b=3}
B. {0<sup>a</sup>1<sup>b</sup>|a=1,b=5}
C. {0<sup>a</sup>1<sup>b</sup>|a=b}
D. More than one of the mentioned is correct
Answer» B. {0<sup>a</sup>1<sup>b</sup>|a=1,b=5}
Discussion
6.

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
7.

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. 0 Errors
B. 1 Error
C. 2 Error
D. Invalid Expression
Answer» B. 1 Error
Discussion
8.

A->aA| a| b
The number of steps to form aab:

A. 2
B. 3
C. 4
D. 5
Answer» C. 4
Discussion
9.

Is the following statement correct?
Statement: Recursive inference and derivation are equivalent.

A. Yes
B. No
Answer» B. No
Discussion
10.

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:

A. program
B. SQL-query
C. XML document
D. All of the mentioned
Answer» E.
Discussion
11.

Which of the following is/are the suitable approaches for inferencing?

A. Recursive Inference
B. Derivations
C. Recursive Inference and Derivations
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
12.

State true or false:
Statement: The recursive inference procedure determines that string w is in the language of the variable A, A being the starting variable.

A. true
B. false
Answer» B. false
Discussion
13.

Which of the following is not a notion of Context free grammars?

A. Recursive Inference
B. Derivations
C. Sentential forms
D. All of the mentioned
Answer» E.
Discussion