FA DFA NFA MCQs Questions Answers

By: Prof. Dr. Fazal Rehman Shamil | Last updated: September 23, 2024

FA DFA NFA MCQs in Theory of Automata (TOA) and Theory of Computation (TOC)

Which statement is correct?
(a) All NFAs are DFAs.
(b) All NFAs are not DFAs.
(c) both a and b

(d) None of these

Answer:

(b) All NFAs are not DFAs.

For each symbolic representation of the alphabet, there is only one state transition in?
(a) FA
(b) NFA
(c) DFA

(d) All of these

Answer:

(c) DFA

Which of the following cannot use Empty String transition?

(a) FA
(b) NFA
(c) DFA

(d) All of these

Answer:

(c) DFA

Which of the following can use Empty String transition?

(a) FA
(b) NFA
(c) DFA

(d) All of these

Answer:

(b) NFA

Dead state may be required in which of the following?
(a) FA
(b) NFA
(c) DFA

(d) All of these

Answer:

(c) DFA

Dead state is not required in which of the following?
(a) FA
(b) NFA
(c) DFA

(d) All of these

Answer:

(b) NFA

The total time needed to run any input string in DFA is ……. than time required in NFA.
(a) more

(b) Less

(c) equal

(d) None of these

Answer:

(b) Less

Which statement is correct about DFA?
(a) All DFAs are derived from NFAs.
(b) All NFAs are derived from DFAs.
(c) Both can’t be derived from each other

(d) Both a and b

Answer:

(a) All DFAs are derived from NFAs.

When it is not fixed that with a specific input where to go next on which state, then it is called?
(A). DFA
(B). NFA
(C). DFSA
(D). None of these
Answer: (B). NFA
In which of the following, its not mandatory to generate transition for each alphabet in the language from a given state to its final state?
(A). DFA
(B). NFA
(C). DFSA
(D). None of these
Answer: (B). NFA
When it is not fixed that with a specific input where to go next on which state, then it is called?
(A). DFA
(B). NFA
(C). DFSA
(D). None of these
Answer: (B). NFA

AUTOMATA THEORY MCQS

Regular expressions MCQs 

FA DFA NFA MCQs 

List of 100+ Important Deterministic Finite Automata

Finite Automata Exercise Solution

Here I am showing you a list of some more important Deterministic Finite Automata used in the theory of automata and theory of computation.

1. DFA for  (a+b)* (a+b)a .
2. DFA for (bb)*(aa)* .
3. DFA for  b+a(a+b)*+a.
4. DFA for (a+b)*b+(bb)*a.
5. DFA for bb+a(a+b)*+aa.
6. DFA for  a(a+b)*+bb(a)* .
7. DFA for  a(a+b)b*+bb(a)*.
8. DFA for  b(aa)*a+a(bb)*b.
9. DFA for a+a(aa+b)*(aa)b.
10. DFA for a+a(aa+b)*+(aa)b.
11. DFA for (a+b)b(a+b)*+(aa)*b.
12. FA for strings starting with a and ending with a.
13. FA for the language of all those strings starting with a.
14. FA for the language of all those strings containing aa as a substring.
15. DFA for the language of all those strings starting and ending with the same letters.
16. DFA for the language of all those strings starting and ending with different letters.
17. DFA for the language of all those strings having double 0 or double 1.
18. DFA for the language of all those strings starting and ending with b.
19. DFA for ending with b.
20. DFA for the string of even A’s and even b’s.
21. DFA for the regular expression of  a(a+b)*+(bb)+a(ba)*+aba+bb*(a+b)*.
22. RegExp and DFA for strings having triple a’s or triple b’s.