In theoretical computer science and formal language theory, a regular language is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science. Alternatively, a regular language can be defined... Wikipedia