This document discusses examples of regular languages and finite automata. It provides regular expressions and finite automata to represent languages over alphabets like {a,b} with certain string properties, such as beginning and ending with the same letter, containing double letters, or having an even number of as and bs. It also discusses equivalent finite automata and finite automata corresponding to finite languages expressed with regular expressions.