Number of times the state q3 or q2 is being a part of

9. Number of times the state q3 or q2 is being a part of extended 6 transition state is

3/4

8/27/2019 Extended Transition Function - Automata Theory Questions and ANSWER s - Sanfoundry
View ANSWER
10. Predict the missing procedure:
1.Δ(Q0, ε) ={Q0},
2.Δ(Q0, 01) = {Q0, Q1}
3.δ(Q0, 010) =?
advertisement

View
ANSWER
4/4

8/27/2019 NFA Language - Automata Theory Questions and ANSWER s - Sanfoundry
Automata Theory Questions and ANSWER s – The Language of NFA
This set of Automata Theory Multiple Choice Questions & ANSWER s (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
Answer: a
Explanation: The conversion of a non-deterministic automata into a deterministic one is a process we call subset
construction or power set construction.
advertisement
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
3
using NFA?
View ANSWER

3. Which of the following does the given NFA represent?
1/4

8/27/2019 NFA Language - Automata Theory Questions and ANSWER s - Sanfoundry
View
ANSWER
4. The number of transitions required to convert the following into equivalents DFA:
View ANSWER

advertisement
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
Answer: a
Explanation: If L is a regular Language, L
c
and L
r
both are regular even.
2/4

8/27/2019 NFA Language - Automata Theory Questions and ANSWER s - Sanfoundry
6. In NFA, this very state is like dead-end non final state: a)
ACCEPT
b) REJECT c)
DISTINCT d)
START
View ANSWER
Answer: b
Explanation: REJECT state will be like a halting state which rejects a particular invalid input.