A regular expression is a definition for a class of strings that can be recognized by a finite-state automaton. An example of a class of strings that is regular would be legal mathematical expressions using only "+" and digits. An example that isn't regular is the same legal mathematical expressions as before, but with properly nested parentheses.