Are there well-specified formal languages that are not regular?
There are indeed well-specified formal languages that cannot be represented by regular expressions, even on a one-letter alphabet. Examples include $\{a^{n^2} \mid n &gt; 0\}$ and $\{a^p \mid p \text{ is a prime number}\}$.