Back Llenguatge regular Catalan Regulární jazyk Czech Reguläre Sprache German Κανονική γλώσσα Greek Lenguaje regular Spanish زبان منظم Persian Säännöllinen kieli Finnish Langage rationnel French שפה רגולרית HE Regularni jezik Croatian

Regular language

For natural language that is regulated, see List of language regulators.
"Kleene's theorem" redirects here. For his theorems for recursive functions, see Kleene's recursion theorem.

In theoretical computer science and formal language theory, a regular language (also called a rational language)[1][2] is a formal language that can be defined by a regular expression, in the strict sense in theoretical computer science (as opposed to many modern regular expression engines, which are augmented with features that allow the recognition of non-regular languages).

Alternatively, a regular language can be defined as a language recognised by a finite automaton. The equivalence of regular expressions and finite automata is known as Kleene's theorem[3] (after American mathematician Stephen Cole Kleene). In the Chomsky hierarchy, regular languages are the languages generated by Type-3 grammars.

  1. ^ Cite error: The named reference Mitkov2003 was invoked but never defined (see the help page).
  2. ^ Cite error: The named reference Lawson2003 was invoked but never defined (see the help page).
  3. ^ Sheng Yu (1997). "Regular languages". In Grzegorz Rozenberg; Arto Salomaa (eds.). Handbook of Formal Languages: Volume 1. Word, Language, Grammar. Springer. p. 41. ISBN 978-3-540-60420-4.

Developed by StudentB