Theory of Computing
THE HYPERTEXTBOOK
Chapter 2. Finite State Automata, Regular Languages, Regular Expressions, and Regular Grammars
Section 2. Finite State Automata

Example

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.