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

Example

The following FSA accepts all strings that contain a 101 substring. Study it to see that this is so.  Will the FSA accept strings that have more than one substring 101?