Explore topic-wise MCQs in Automata Theory.

This section includes 18 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.

A->aAa|bAb|a|b|eWhich among the following is the correct option for the given production?

A. Left most derivation
B. Right most derivation
C. Recursive Inference
D. None of the mentioned
Answer» B. Right most derivation
Discussion
2.

Statement: Left most derivations are lengthy as compared to Right most derivations.Choose the correct option:

A. correct statement
B. incorrect statement
C. may or may not be correct
D. depends on the language of the grammar
Answer» D. depends on the language of the grammar
Discussion
3.

Statement: A digit, when used in the CFG notation, will always be used as a terminal.State true or false?

A. True
B. False
Answer» B. False
Discussion
4.

Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.Which of the following is a correct option for the given statement?

A. Absorption Law
B. Idempotent Law
C. Closure Law
D. Commutative Law
Answer» C. Closure Law
Discussion
5.

The given regular language corresponds to which of the given regular languagee+1+(1+0)*0+(0+1)*11

A. The language of all strings that end with 11 or 00
B. The language of all strings that end with 0 or 1
C. The language of all strings which does not end with 01
D. None of the mentioned
Answer» D. None of the mentioned
Discussion
6.

The minimum number of 1’s to be used in a regular expression of the given language:R(x): The language of all strings containing exactly 2 zeroes.

A. 2
B. 3
C. 0
D. 1
Answer» C. 0
Discussion
7.

Which of the following regular expression is equivalent to R(1,0)?R(1,0)={111*}*

A. (11+111)*
B. (111+1111)*
C. (111+11*)*
D. All of the mentioned
Answer» B. (111+1111)*
Discussion
8.

The minimum length of a string {0,1}* not in the language corresponding to the given regular expression:(0*+1*)(0*+1*)(0*+1*)

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

STATEMENT:_LEFT_MOST_DERIVATIONS_ARE_LENGTHY_AS_COMPARED_TO_RIGHT_MOST_DERIVATIONS.?$

A.
B. correct statement
C. incorrect statement
Answer» D.
Discussion
10.

A->aAa|bAb|a|b|e$

A.
B. Left most derivation
C. Right most derivation
Answer» B. Left most derivation
Discussion
11.

Choose the incorrect process to check whether the string belongs to the language of certain variable or not?

A. recursive inference
B. derivations
C. head to body method
D. All of the mentioned
Answer» E.
Discussion
12.

Statement: A digit, when used in the CFG notation, will always be used as a terminal.

A.
B. True
Answer» B. True
Discussion
13.

Which among the following can be an annihilator for multiplication operation?

A. 0
B. 1
C. 100
D. 22/7
Answer» B. 1
Discussion
14.

Statement: If we take the union of two identical expression, we can replace them by one copy of the expression.

A.
B. Absorption Law
C. Idempotent Law
Answer» C. Idempotent Law
Discussion
15.

The given regular language corresponds to which of the given regular language

A. *0+(0+1)*11
B. The language of all strings that end with 11 or 00
C. The language of all strings that end with 0 or 1
D. The language of all strings which does not end with 01
Answer» D. The language of all strings which does not end with 01
Discussion
16.

The minimum number of 1’s to be used in a regular expression of the given language:$

A. : The language of all strings containing exactly 2 zeroes.
B. 2
C. 3
D. 0
Answer» C. 3
Discussion
17.

Which of the following regular expression is equivalent to R(1,0)?

A. ={111*}*
B. (11+111)*
C. (111+1111)*
D. (111+11*)*
Answer» B. (11+111)*
Discussion
18.

The minimum length of a string {0,1}* not in the language corresponding to the given regular expression:

A. (0*+1*)(0*+1*)
B. 3
C. 4
D. 5
Answer» C. 4
Discussion