Explore topic-wise MCQs in Automata Theory.

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

If n is the length of Input string and m is the number of nodes, the running time of DFA is x that of NFA.Find x?

A. 1/m2
B. 2m
C. 1/m
D. log m
Answer» B. 2m
Discussion
2.

The construction time for DFA from an equivalent NFA (m number of node)is:

A. O(m2)
B. O(2m)
C. O(m)
D. O(log m)
E. is:a) O(m2)b) O(2m)c) O(m)d) O(log m)
Answer» C. O(m)
Discussion
3.

Given Language L= {xϵ {a, b}*|x contains aba as its substring}Find the difference of transitions made in constructing a DFA and an equivalent NFA?

A. 2
B. 3
C. 4
D. Cannot be determined.
Answer» B. 3
Discussion
4.

Which of the following is correct proposition?Statement 1: Non determinism is a generalization of Determinism.Statement 2: Every DFA is automatically an NFA

A. Statement 1 is correct because Statement 2 is correct
B. Statement 2 is correct because Statement 2 is correct
C. Statement 2 is false and Statement 1 is false
D. Statement 1 is false because Statement 2 is falseView Answer
Answer» C. Statement 2 is false and Statement 1 is false
Discussion
5.

NFA, in its name has ’non-deterministic’ because of :

A. The result is undetermined
B. The choice of path is non-deterministic
C. The state to be transited next is non-deterministic
D. All of the mentioned
Answer» C. The state to be transited next is non-deterministic
Discussion
6.

Given Language: L= {ab U aba}*If X is the minimum number of states for a DFA and Y is the number of states to construct the NFA,|X-Y|=?

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

Which of the following options is correct?Statement 1: Initial State of NFA is Initial State of DFA.Statement 2: The final state of DFA will be every combination of final state of NFA.

A. Statement 1 is true and Statement 2 is true
B. Statement 1 is true and Statement 2 is false
C. Statement 1 can be true and Statement 2 is true
D. Statement 1 is false and Statement 2 is also false
Answer» B. Statement 1 is true and Statement 2 is false
Discussion
8.

IF_N_IS_THE_LENGTH_OF_INPUT_STRING_AND_M_IS_THE_NUMBER_OF_NODES,_THE_RUNNING_TIME_OF_DFA_IS_X_THAT_OF_NFA.FIND_X??$

A. 1/m<sup>2</sup>
B. 2<sup>m</sup>
C. 1/m
D. log m
Answer» D. log m
Discussion
9.

THE_CONSTRUCTION_TIME_FOR_DFA_FROM_AN_EQUIVALENT_NFA_(M_NUMBER_OF_NODE)IS:?$

A. O(m<sup>2</sup>)
B. O(2<sup>m</sup>)
C. O(m)
D. O(log m)
Answer» B. O(2<sup>m</sup>)
Discussion
10.

Given Language L= {xϵ {a, b}*|x contains aba as its substring?#

A.
B. 2
C. 3
Answer» C. 3
Discussion
11.

Statement 1 is correct because Statement 2 is correct

A. Statement 2 is correct because Statement 2 is correct
B. Statement 2 is false and Statement 1 is false
C. Statement 1 is false because Statement 2 is false
Answer» B. Statement 2 is false and Statement 1 is false
Discussion
12.

NFA, in its name has ’non-deterministic’ because of :$

A. The result is undetermined
B. The choice of path is non-deterministic
C. The state to be transited next is non-deterministic
D. All of the mentioned
Answer» C. The state to be transited next is non-deterministic
Discussion
13.

If NFA of 6 states excluding the initial state is converted into DFA, maximum possible number of states for the DFA is ?

A. 64
B. 32
C. 128
D. 127
Answer» D. 127
Discussion
14.

An automaton that presents output based on previous state or current input:

A. Acceptor
B. Classifier
C. Transducer
D. None of the mentioned.
Answer» D. None of the mentioned.
Discussion
15.

Given Language: L= {ab U aba}*

A.
B.
Answer» B.
Discussion
16.

Which of the following options is correct?

A.
B.
Answer» B.
Discussion