Explore topic-wise MCQs in Automata Theory.

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

Let N (Q, , , q0, A) be the NFA recognizing a language L. Then for a DFA (Q , , , q0 , A ), which among the following is true?

A. Q = P(Q)
B. = (R, a) = {q Q | q (r, a), for some r R}
C. Q = {q0}
D. All of the mentioned
Answer» E.
Discussion
2.

Which of the following options is correct for the given statement?
Statement: If K is the number of states in NFA, the DFA simulating the same language would have states less than 2k.

A. True
B. False
Answer» B. False
Discussion
3.

Statement 1: NFA computes the string along parallel paths.
Statement 2: An input can be accepted at more than one place in an NFA.

A. nWhich among the following options are most appropriate?
B. Statement 1 is true while 2 is not
C. Statement 1 is false while is not
D. Statement 1 and 2, both are true
E. Statement 1 and 2, both are false
Answer» D. Statement 1 and 2, both are true
Discussion
4.

Which among the following NFA s is correct corresponding to the given Language?
L= {x {0, 1} | 3rd bit from right is 0}

A. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6a.png"><img alt="NFA s corresponding to given Language L= {{0, 1} | 3rd bit from right is 0} - option a" class="alignnone size-full wp-image-160276" height="207" sizes="(max-width: 572px) 100vw, 572px" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6a.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6a.png 572w, https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6a-300x109.png 300w" width="572"/></a>
B. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png"><img alt="NFA s corresponding to given Language L= {{0, 1} | 3rd bit from right is 0} - option b" class="alignnone size-full wp-image-160277" height="217" sizes="(max-width: 572px) 100vw, 572px" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png 572w, https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b-300x114.png 300w" width="572"/></a>
C. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6c.png"><img alt="NFA s corresponding to given Language L= {{0, 1} | 3rd bit from right is 0} - option c" class="alignnone size-full wp-image-160278" height="237" sizes="(max-width: 582px) 100vw, 582px" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6c.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6c.png 582w, https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6c-300x122.png 300w" width="582"/></a>
D. None of the mentioned
Answer» B. <a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png"><img alt="NFA s corresponding to given Language L= {{0, 1} | 3rd bit from right is 0} - option b" class="alignnone size-full wp-image-160277" height="217" sizes="(max-width: 572px) 100vw, 572px" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b.png 572w, https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-aplications-dfa-q6b-300x114.png 300w" width="572"/></a>
Discussion
5.

Predict the analogous operation for the given language:
A: {[p, q] | p A1, q does not belong to A2}

A. A1-A2
B. A2-A1
C. A1.A2
D. A1+A2
Answer» B. A2-A1
Discussion
6.

Given Language: {x | it is divisible by 3}
The total number of final states to be assumed in order to pass the number constituting {0, 1} is

A. 0
B. 1
C. 2
D. 3
Answer» D. 3
Discussion