Explore topic-wise MCQs in Automata Theory.

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

The sum of minimum and maximum number of final states for a DFA n states is equal to:

A. n+1
B. n
C. n-1
D. n+2
Answer» B. n
Discussion
2.

The maximum sum of in degree and out degree over a state in a DFA can be determined as:∑= {a, b, c, d}

A. 4+4
B. 4+16
C. 4+0
D. depends on the Language
Answer» E.
Discussion
3.

The maximum number of transition which can be performed over a state in a DFA?∑= {a, b, c}

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

Given:L1= {xϵ ∑*|x contains even no’s of 0’s}L2= {xϵ ∑*|x contains odd no’s of 1’s}No of final states in Language L1 U L2?

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

Which of the following x is accepted by the given DFA (x is a binary string ∑= {0,1})?

A. divisible by 3
B. divisible by 2
C. divisible by 2 and 3
D. divisible by 3 and 2
Answer» E.
Discussion
6.

Which of the following option is correct?A= {{abc, aaba}. {ε, a, bb}}

A. abcbb ₵ A
B. ε₵A
C. ε may not belong to A
D. abca ₵ A
Answer» C. ε may not belong to A
Discussion
7.

δˆ tells us the best:

A. how the DFA S behaves on a word u
B. the state is the dumping state
C. the final state has been reached
D. Kleene operation is performed on the set
Answer» B. the state is the dumping state
Discussion
8.

According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}Statement 1: q ϵ Q’; Statement 2: FϵQ

A. Statement 1 is true, Statement 2 is false
B. Statement 1 is false, Statement 2 is true
C. Statement 1 is false, Statement 2 may be true
D. Statement 1 may be true, Statement 2 is false
Answer» C. Statement 1 is false, Statement 2 may be true
Discussion
9.

The_sum_of_minimum_and_maximum_number_of_final_states_for_a_DFA_n_states_is_equal_to:$

A. n+1
B. n
C. n-1
D. n+2
Answer» B. n
Discussion
10.

The maximum number of transition which can be performed over a state in a DFA?

A.
B. 1
C. 2
Answer» D.
Discussion
11.

For a DFA accepting binary numbers whose decimal equivalent is divisible by 4, what are all the possible remainders?

A. 0
B. 0,2
C. 0,2,4
D. 0,1,2,3
Answer» E.
Discussion
12.

Which of the following option is correct?

A.
B. abcbb ₵ A
C. ε₵A
Answer» C. ‚âà√≠¬¨¬µ‚Äö√Ñ√∂‚àö√°¬¨¬µA
Discussion
13.

δˆ tells us the best:$

A. how the DFA S behaves on a word u
B. the state is the dumping state
C. the final state has been reached
D. Kleene operation is performed on the set
Answer» B. the state is the dumping state
Discussion
14.

According to the 5-tuple representation i.e. FA= {Q, ∑, δ, q, F}$

A.
B. Statement 1 is true, Statement 2 is false
C. Statement 1 is false, Statement 2 is true
Answer» C. Statement 1 is false, Statement 2 is true
Discussion
15.

How many languages are over the alphabet R?

A. countably infinite
B. countably finite
C. uncountable finite
D. uncountable infinite
Answer» E.
Discussion