Giovanni Pace
Let's build a Nondeterministic Finite State Automaton (NFSA) step by step from the language L=(a+b)*b(a+b): a simple linear chain to start reasoning about transitions in nondeterministic automata.