Explore topic-wise MCQs in Automata Theory.

This section includes 7 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 among the following states would be notated as the final state/acceptance state?
L= {x = {a, b} | length of x is 2}

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q9.png"><img alt="The final state/acceptance state is q2 to the given language" class="aligncenter size-full wp-image-145263" height="323" sizes="(max-width: 510px) 100vw, 510px" src="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q9.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q9.png 510w, https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q9-300x190.png 300w" width="510"/></a>
B. q1
C. q2
D. q1, q2
E. q3
Answer» C. q2
Discussion
2.

Which among the following is not notated as infinite language?

A. Palindrome
B. Reverse
C. Factorial
D. L={ab}*
Answer» D. L={ab}*
Discussion
3.

The complement of a language will only be defined when and only when the __________ over the language is defined.

A. String
B. Word
C. Alphabet
D. Grammar
Answer» D. Grammar
Discussion
4.

Which among the following is the missing transition in the given DFA?
L= {x = {a, b} | x starts with a and ends with b}

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q6.png"><img alt="Find the missing transition in the given DFA" class="aligncenter size-full wp-image-145262" height="324" sizes="(max-width: 559px) 100vw, 559px" src="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q6.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q6.png 559w, https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q6-300x174.png 300w" width="559"/></a>
B. (q0, a) = q0
C. (F, a) = q1
D. (F, a) = D
E. (q1, a) = D
Answer» C. (F, a) = q1
Discussion
5.

Fill the missing blank in the given Transition Table:
Language L= {x = {0,1} |x accepts all the binary strings not divisible by 3}

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png"><img alt="The tabular representation of DFA is Q1" class="aligncenter size-full wp-image-145261" height="81" sizes="(max-width: 394px) 100vw, 394px" src="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png" srcset="https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5.png 394w, https://www.sanfoundry.com/wp-content/uploads/2017/06/automata-theory-questions-answers-simpler-notations-q5-300x62.png 300w" width="394"/></a>
B. Q0
C. Q1
D. Q2
E. No Transition
Answer» C. Q1
Discussion
6.

4.Predict the following step in the given bunch of steps which accepts a strings which is of even length and has a prefix= 01
(q0, ) =q0 < (q0,0) = ( (q0, ),0) = (q0,0) =q1 < _______________

A. (q0, 011) = ( (q0,1), 1) = (q2, 1) =q3
B. (q0, 01) = ( (q0, 0), 1) = (q1, 1) =q2
C. (q0, 011) = ( (q01, 1), 1) = (q2, 0) =q3
D. (q0, 0111) = ( (q0, 011), 0) = (q3, 1) =q2
Answer» C. (q0, 011) = ( (q01, 1), 1) = (q2, 0) =q3
Discussion
7.

2.Let u= 1101 , v= 0001 , then uv=11010001 and vu= 00011101.Using the given information what is the identity element for the string?

A. u<sup>-1</sup>
B. v<sup>-1</sup>
C. u<sup>-1</sup>v<sup>-1</sup>
D.
Answer» E.
Discussion