Current lesson | Lesson 2/8

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

Exercises on Automata and Formal Languages – Solutions and Explanations 0%
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.
Instructor
Up next NFSA Exercises - A Double State Chain (Theoretical Computer Science)