Course overview

Exercises on Automata and Formal Languages – Solutions and Explanations

Course content8 lessons
NFSA Exercises - A Simple Linear Chain (Theoretical Computer Science) NFSA Exercises - A Simple Linear Chain (Theoretical Computer Science) Lesson 1 NFSA Exercises - A Simplified Double State Chain (Theoretical Computer Science) NFSA Exercises - A Simplified Double State Chain (Theoretical Computer Science) Lesson 2 NFSA Exercises - A Double State Chain (Theoretical Computer Science) NFSA Exercises - A Double State Chain (Theoretical Computer Science) Lesson 3 NFSA Exercises - A More Complex Double State Chain (Theoretical Computer Science) NFSA Exercises - A More Complex Double State Chain (Theoretical Computer Science) Lesson 4 NFSA Exercises - A State Chain with a Loop (Theoretical Computer Science) NFSA Exercises - A State Chain with a Loop (Theoretical Computer Science) Lesson 5 NFSA Exercises - Avoiding Symbol Sequences (Theoretical Computer Science) NFSA Exercises - Avoiding Symbol Sequences (Theoretical Computer Science) Lesson 6 NFSA Exercises - A Non-Accepting Terminal State (Theoretical Computer Science) NFSA Exercises - A Non-Accepting Terminal State (Theoretical Computer Science) Lesson 7 NFSA Exercises - A Loop Interrupted by Acceptance with Cardinality Constraints (Theoretical Computer Science) NFSA Exercises - A Loop Interrupted by Acceptance with Cardinality Constraints (Theoretical Computer Science) Lesson 8
Previous
Up next Next
Current lesson | Lesson 3/8

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

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