Explore topic-wise MCQs in Automata Theory.

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

Generate a regular expression for the given language:l
L(x): {x {0,1}*| x ends with 1 nd does not contain a substring 01}

A. (0+01)*
B. (0+01)*1
C. (0+01)*(1+01)
D. All of the mentioned
Answer» D. All of the mentioned
Discussion
2.

The minimum number of states required in a DFA (along with a dumping state) to check whether the 3rd bit is 1 or not for |n|>=3

A. 3
B. 4
C. 5
D. 1
Answer» D. 1
Discussion
3.

Generate a regular expression for the following problem statement:
P(x): String of length 6 or less for ={0,1}*

A. (1+0+e)6
B. (10)6
C. (1+0)(1+0)(1+0)(1+0)(1+0)(1+0)
D. More than one of the mentioned is correct
Answer» B. (10)6
Discussion
4.

Generate a regular expression for the following problem statement:
Password Validation: String should be 8-15 characters long. String must contain a number, an Uppercase letter and a Lower case letter.

A. ^(?=.*[a-z])(?=.*[A-Z])(?=.* d).{8,15}$
B. ^(?=.*[a-z])(?=.*[A-Z])(?=.* d).{9,16}$
C. ^(?=.[a-z])(?=.[A-Z])(?=. d).{8,15}$
D. None of the mentioned
Answer» B. ^(?=.*[a-z])(?=.*[A-Z])(?=.* d).{9,16}$
Discussion
5.

The total number of states required to automate the given regular expression
(00)*(11)*

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