Match a word two ways on the same NFA: a backtracker that tries one path at a time, and a simulation that follows every path at once. See why (a|a)*b can take exponential time.
This interactive visualization needs JavaScript.