Exercises
Exercise 1. Create a finite state automaton that recognizes the set of all binary strings that end in 111.
Exercise 2. Create a finite state automaton that recognizes the set of all strings of a's, b's, and c's that start with an a and have no two successive characters the same.
