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 (omitting certain features found in the regular expressions offered in Unix / Perl / etc. that make those more expressive).

Log in or register to write something here or to contact authors.