Explore topic-wise MCQs in Automata Theory.

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

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

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

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

The given regular language corresponds to which of the given regular language
e+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
5.

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

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

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