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.

Dot operator in regular expression resembles which of the following?

A. Expressions are juxtaposed
B. Expressions are multiplied
C. Cross operation
D. None of the mentioned
Answer» B. Expressions are multiplied
2.

According to the precedence rules, x-y-z is equivalent to which of the following?

A. (x-y)-z
B. x-(y-z)
C. Both (x-y)-z and x-(y-z)
D. None of the mentioned
Answer» B. x-(y-z)
3.

Which of the following regular expressions represents the set of strings which do not contain a substring rt if = {r, t}

A. (rt)*
B. (tr)*
C. (r*t*)
D. (t*r*)
Answer» E.
4.

(a + b*c) most correctly represents:

A. (a +b) *c
B. (a)+((b)*.c)
C. (a + (b*)).c
D. a+ ((b*).c)
Answer» E.
5.

The finite automata accept the following languages:

A. Context Free Languages
B. Context Sensitive Languages
C. Regular Languages
D. All the mentioned
Answer» D. All the mentioned
6.

Which of the following represents a language which has no pair of consecutive 1 s if = {0,1}?

A. (0+10)*(1+ )
B. (0+10)*(1+ )*
C. (0+101)*(0+ )
D. (1+010)*(1+ )
Answer» B. (0+10)*(1+ )*
7.

If = {0,1}, then * will result to:

A.
B.
C.
D. None of the mentioned
Answer» B.
8.

Let for = {0,1} R= ( ) *, the language of R would be

A. {w | w is a string of odd length}
B. {w | w is a string of length multiple of 3}
C. {w | w is a string of length 3}
D. All of the mentioned
Answer» C. {w | w is a string of length 3}
9.

Which of the following is correct?
Statement 1: represents a single string in the set.

A. nStatement 2: represents the language that consist of no string.
B. Statement 1 and 2 both are correct
C. Statement 1 is false but 2 is correct
D. Statement 1 and 2 both are false
E. There is no difference between both the statements, and are different notation for same reason
Answer» B. Statement 1 and 2 both are correct