non-deterministic finite state machine tool
Enter a non-deterministic finite state machine box below by defining its transitions, then initial state and final state(s) using the following notation:
q0, a -> q1
q0, b -> q1
q1, a -> q1
q2, b -> q2
q1, epsilon -> q2

You can list more than one final state, one on each line. Each transition goes on its own line. The format is: state, symbol (or epsilon) -> new_state
The symbol epsilon is used to denote an epsilon move and consumes no input. You can then give an input word and it will run the machine on that word.
non-deterministic finite automaton description
input word