Current lesson | Lesson 7/8

NFSA Exercises - A Non-Accepting Terminal State (Theoretical Computer Science)

Exercises on Automata and Formal Languages – Solutions and Explanations 0%
Let's build the automaton for a language with a non-accepting terminal state: strings must end with 'bc' and must not contain 'ccc' — I'll explain how each constraint maps to transitions and states.
Instructor
Up next NFSA Exercises - A Loop Interrupted by Acceptance with Cardinality Constraints (Theoretical Computer Science)