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.

Given:
L= {x = {0,1} |x=0n1n for n>=1}; Can there be a DFA possible for the language?

A. Yes
B. No
Answer» C.
Discussion
2.

Given L= {X *= {a, b} |x has equal number of a, s and b s}.
Which of the following property satisfy the regularity of the given language?

A. Regularity is dependent upon the length of the string
B. Regularity is not dependent upon the length of the string
C. Can t be said for a particular string of a language
D. It may depend on the length of the string
Answer» C. Can t be said for a particular string of a language
Discussion
3.

For the DFA given below compute the following:
Union of all possible combinations at state 7,8 and 9.

A. n<a href="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-dfa-processing-strings-q6.png"><img alt="Find the union of all possible combinations at state 7, 8 &amp; 9 for the DFA" class="alignnone size-full wp-image-160248" height="356" src="https://www.sanfoundry.com/wp-content/uploads/2017/05/automata-theory-questions-answers-dfa-processing-strings-q6.png" width="583"/></a>
B. {aba, ac, cc, ca, cb, bc, bab, ca}
C. {bab, bc, ac, aba, ca, aac, ccb}
D. {cc, ca, cb, aba, bab, ac}
E. {aba, ac, cc, ca, cb, bc, bab, caa}
Answer» E. {aba, ac, cc, ca, cb, bc, bab, caa}
Discussion
4.

Let = {a, b, . z} and A = {Hello, World}, B= {Input, Output}, then (A* B) U (B* A) can be represented as:

A. {Hello, World, Input, Output, }
B. {Hello, World, }
C. {Input, Output, }
D. {}
Answer» E.
Discussion
5.

The password to the admins account= administrator . The total number of states required to make a password-pass system using DFA would be __________

A. 14 states
B. 13 states
C. 12 states
D. A password pass system cannot be created using DFA
Answer» B. 13 states
Discussion