Automata Theory Questions and Answers – The Language of NFA

This set of Automata Theory Multiple Choice Questions & Answers (MCQs) focuses on “The Language of NFA”.

1. Subset Construction method refers to:
a) Conversion of NFA to DFA
b) DFA minimization
c) Eliminating Null references
d) ε-NFA to NFA
View Answer

2. Given Language:
L_n= {xϵ {0,1} * | |x|≥n, nth symbol from the right in x is 1}
How many state are required to execute L₃ using NFA?
a) 16
b) 15
c) 8
d) 7
View Answer

3. Which of the following does the given NFA represent?

a) {11, 101} * {01}
b) {110, 01} * {11}
c) {11, 110} * {0}
d) {00, 110} * {1}
View Answer

4. The number of transitions required to convert the following into equivalents DFA:

a) 2
b) 3
c) 1
d) 0
View Answer

Answer: a
Explanation:

5. If L is a regular language, L^c and L^r both will be:
a) Accepted by NFA
b) Rejected by NFA
c) One of them will be accepted
d) Cannot be said
View Answer

6. In NFA, this very state is like dead-end non final state:
a) ACCEPT
b) REJECT
c) DISTINCT
d) START
View Answer

7. We can represent one language in more one FSMs, true or false?
a) TRUE
b) FALSE
c) May be true
d) Cannot be said
View Answer

8. The production of form non-terminal -> ε is called:
a) Sigma Production
b) Null Production
c) Epsilon Production
d) All of the mentioned
View Answer

9. Which of the following is a regular language?
a) String whose length is a sequence of prime numbers
b) String with substring ww^r in between
c) Palindrome string
d) String with even number of Zero’s
View Answer

10. Which of the following recognizes the same formal language as of DFA and NFA?
a) Power set Construction
b) Subset Construction
c) Robin-Scott Construction
d) All of the mentioned
View Answer

Sanfoundry Global Education & Learning Series – Automata Theory.
To practice all areas of Automata Theory, here is complete set of 1000+ Multiple Choice Questions and Answers.