Noun
A formal language that can be expressed using a regular expression or finite-state machine.
- Synonyms
- rational language
- Related words
- Broader terms
- Examples
-
There is an interesting way to get the negation (complement) of a regular language L defined by a FS automaton, provided the automaton is ε-free.
More examples (1)
A regular language is one that can be generated by a regular grammar or finite-state automaton, the lowest level of the Chomsky hierarchy. It is well known that these grammars are inadequate to represent natural language syntax.