Explore topic-wise MCQs in Automata Theory.

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

δ(A,1) = B, δ(A,0) =A Δ (B, (0,1)) =C δ(C,0) = A (Initial state =A)String=”011001” is transit at which of the states?

A. A
B. C
C. B
D. Invalid String
Answer» B. C
Discussion
2.

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
3.

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
4.

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

A. {aba, ac, cc, ca, cb, bc, bab, ca}
B. {bab, bc, ac, aba, ca, aac, ccb}
C. {cc, ca, cb, aba, bab, ac}
D. {aba, ac, cc, ca, cb, bc, bab, caa}
Answer» E.
Discussion
5.

Let the given DFA consist of x states. Find x-y such that y is the number of states on minimization of DFA?

A. 3
B. 2
C. 1
D. 4
Answer» C. 1
Discussion
6.

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

A. can be represented as:a) {Hello, World, Input, Output, ε}
B. {Hello, World, ε}
C. {Input, Output, ε}
D. {}
Answer» E.
Discussion
7.

Which of the following is the corresponding Language to the given DFA?

A. L= {x ϵ {0, 1} * | x ends in 1 and does not contain substring 01}
B. L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 00}
C. L= {x ϵ {0,1} |x ends in 1 and does not contain substring 00}
D. L= {x ϵ {0,1} * |x ends in 1 and does not contain substring 11}
Answer» C. L= {x ϵ {0,1} |x ends in 1 and does not contain substring 00}
Discussion
8.

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
9.

δ(A,1) = B, δ(A,0) =?#

A. ) =C
B. = A (Initial state =A)
C.
Answer» B. = A (Initial state =A)
Discussion
10.

Given:

A.
B. Yes
Answer» C.
Discussion
11.

Given L= {Xϵ∑*= {a, b} |x has equal number of a, s and b’s}.$

A.
B. Regularity is dependent upon the length of the string
C. Regularity is not dependent upon the length of the string
Answer» C. Regularity is not dependent upon the length of the string
Discussion
12.

For a machine to surpass all the letters of alphabet excluding vowels, how many number of states in DFA would be required?

A. 3
B. 2
C. 22
D. 27
Answer» B. 2
Discussion
13.

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
14.

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