The total number of states to build the given language using DFA:

L= {w | w has exactly 2 a’s and at least 2 b’s}

Explore topic-wise MCQs in Automata Theory Questions and Answers.

This section includes 3 Mcqs, each offering curated multiple-choice questions to sharpen your Automata Theory Questions and Answers knowledge and support exam preparation. Choose a topic below to get started.

1.	The total number of states to build the given language using DFA:
A.	L= {w \| w has exactly 2 a’s and at least 2 b’s}
B.	10
C.	11
D.	12
E.	13
Answer» B. 10

Discussion

2.	Predict the number of transitions required to automate the following language using only 3 states:
A.	L= {w \| w ends with 00}
B.	3
C.	2
D.	4
E.	Cannot be said
Answer» B. 3

Discussion

3.	John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?
A.	9
B.	11
C.	12
D.	15
Answer» B. 11

Discussion

Explore topic-wise MCQs in Automata Theory Questions and Answers.

The total number of states to build the given language using DFA:

Predict the number of transitions required to automate the following language using only 3 states:

John is asked to make an automaton which accepts a given string for all the occurrence of ‘1001’ in it. How many number of transitions would John use such that, the string processing application works?