← All topics
Quiz: NFA and Subset Construction: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. When does an NFA accept a string?
- Q2. What is ε-closure(A) in the demo?
- Q3. An NFA has n states. At most how many states can the DFA from subset construction have?
- Q4. In the "ending in ab" conversion, which DFA states are accepting?
- Q5. Compared with DFAs, NFAs recognise:
- Q6. In an NFA, what happens to a path when there is no transition for the next symbol?
- Q7. An NFA accepts strings whose 4th symbol from the end is 1. How many states does the smallest DFA need?
- Q8. What does this print? (code)
- Q9. In subset construction, which DFA state is the start state?
- Q10. Why might a regex engine simulate the NFA directly instead of building the full DFA?