Giovanni Pace
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.