2. Show, in the style of the figure on page 798, a sequence of transitions that demonstrates that the NFA that you drew above recognizes the text string.
A A D B C D A D D.
Just list the set of states after each step. The solution is started for illustration purposes.
After ε-transitions from start: 0, 1, 2, 3 ... After matching A: ... After ε-trans: ... After matching A: ...