Module 19 Worksheet
In Class Questions
1) (S5) For the given NFA M, what states can it be in after processing string aa?
2) (S6) Identify some other strings that cause NFA M to end up in the exact same set of
states.
3) (S6) Suppose for some string z over {a,b} that aaz is in L(M). Use your answer to
question 2 to identify some other strings that would also be in L(M).
4) (S13) What is true about the bottom 4 states of M’ for the given example?
Take home review questions
1) The key idea in the construction of this module is that every state in the resulting FSA
M’ corresponds to a what in the original NFA M?
2) Consider the following NFA.
How many states total are there in the resulting FSA (including states unreachable
from the initial state of the FSA)?
How many accepting states in the resulting FSA (including states unreachable from
the initial state of the FSA)?
a
a,b
b
III III