NFSA Exercises - A Simplified Double State Chain (Theoretical Computer Science)
Let's solve an NFSA exercise for the language L=(ab)*+(ba)*: a simplified double state chain with two alternative branches, showing how to correctly model both paths in the automaton.