Quick example of a regular language and how to prove it with a finite state automata.
No download links available.
