The following two Regular Expressions (RE) are equivalent:
Drawing the Non-Deterministic Finite Automata (NFA) makes it easier to ferret out the RE than drawing the “strictly” Deterministic Finite Automata (DFA).
Chad Salinas find an equivalent RE example.
Posted by Chad Salinas 