The language defined on the alphabet {a,b} consisting of the words a^n b^n. This language is not a regular language, leading to the common assertion that regular expressions can't count.