Current lesson | Lesson 4/8

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

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