NFSA Exercises - A More Complex Double State Chain (Theoretical Computer Science)
Let's solve the exercise for L=(ab)*+(aab)*: a more articulated double state chain where the two branches have sequences of different lengths, walking through the reasoning behind each transition.