NFSA Exercises - A Double State Chain (Theoretical Computer Science)

Giovanni Pace

Description

Let's build the automaton for L=(aa)*+(bb)*: a double state chain that introduces the distinction between the two alphabet symbols and shows how to handle parallel branches in the automaton.