Explore topic-wise MCQs in Automata Theory.

This section includes 9 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_PAIR_OF_REGULAR_EXPRESSION_ARE_NOT_EQUIVALENT??$

A. 1(01)* and (10)*1
B. x(xx)* and (xx)*x
C. (ab)* and a*b*
D. x+ and x*x+
Answer» D. x+ and x*x+
Discussion
2.

ΦL is equivalent t?#

A. LΦ
B. Φ
C. L
D. ϵ
Answer» B. ‚âà√≠¬¨‚àÇ
Discussion
3.

(a+b)* is equivalent to

A. b*a*
B. (a*b*)*
C. a*b*
D. none of the mentioned
Answer» C. a*b*
Discussion
4.

ϵL is equivalent to$

A. ϵ
B. Φ
C. L
D. Lϵ
Answer» D. L‚âà√¨¬¨¬µ
Discussion
5.

a? is equivalent to

A. a
B. a+Φ
C. a+ϵ
D. wrong expression
Answer» D. wrong expression
Discussion
6.

Regular expression Φ* is equivalent to$

A. ϵ
B. Φ
C. 0
D. 1
Answer» B. ‚âà√≠¬¨‚àÇ
Discussion
7.

Precedence of regular expression in decreasing order is

A. * , . , +
B. . , * , +
C. . , + , *
D. + , a , *
Answer» B. . , * , +
Discussion
8.

Regular expression {0,1} is equivalent to

A. 0 U 1
B. 0 / 1
C. 0 + 1
D. All of the mentioned
Answer» E.
Discussion
9.

A regular language over an alphabet a is one that can be obtained from

A. union
B. concatenation
C. kleene
D. All of the mentioned
Answer» E.
Discussion