In theoretical computer science and formal language theory, a regular language is a formal language that can be expressed using a regular expression. Note that the "regular expression" features provided with many programming languages are augmented with features that make them capable of recognizing languages that can not be expressed by the formal regular expressions (as formally defined below).
In the Chomsky hierarchy, regular languages are defined to be the languages that are generated by Type-3 grammars (regular grammars). Regular languages are very useful in input parsing and programming language design.
Read more about Regular Language: Formal Definition, Equivalence To Other Formalisms, Closure Properties, Deciding Whether A Language Is Regular, Complexity Results, Subclasses, The Number of Words in A Regular Language, Generalizations
Famous quotes containing the words regular and/or language:
“The solid and well-defined fir-tops, like sharp and regular spearheads, black against the sky, gave a peculiar, dark, and sombre look to the forest.”
—Henry David Thoreau (1817–1862)
“For all symbols are fluxional; all language is vehicular and transitive, and is good, as ferries and horses are, for conveyance, not as farms and houses are, for homestead.”
—Ralph Waldo Emerson (1803–1882)