In
formal language theory, a
regular language is a language (i.e. a possibly infinite set of finite sequences of symbols from a finite alphabet) that can be described using a
finite state automaton.
Alternative methods of describing regular languages are regular grammars
and regular expressions (but not those found in Unix / Perl / etc.; they are more expressive).