NFSA Exercises - A State Chain with a Loop (Theoretical Computer Science)

Giovanni Pace

Description

Let's build the automaton for L=(abc)*: a state chain with a loop that shows how to handle repeated three-symbol sequences in a nondeterministic finite state automaton.