The N in NFA stands for non-deterministic. Our computers, however, are utterly deterministic beasts, which makes "true" simulation of an NFA impossible. But we do know how to simulate DFAs (in fact, I ...
See that this is a DFA - no eps transitions, no more than a single transition on each input from a state. Verify that it indeed recognizes the regular expression (a|b)*abb [size="5"]That's it, folks!
Some results have been hidden because they may be inaccessible to you
Show inaccessible results