English: Graph of all possible runs of the nondeterministic finite automaton shown at File:NFASimpleExample.svg on the input string "10". That string is not accepted by the automaton, since no path from the start state to an accepting state exists. Arc label (and color): input symbol, node label: state, green: start state, red: accept state(s).