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

Exercise

Create a finite state automaton that recognizes all binary strings that end in 111.  Be sure to use the compare button when you think you have a correct design.