In formal grammar theory, mildly context-sensitive languages are a class of formal languages which can be efficiently parsed, but still possess enough context sensitivity to allow the parsing of natural languages. The concept was first introduced by Aravind Joshi in 1985.
The formal conditions imposed on the class are:
Some attempts at creating mildly context-sensitive language formalisms include:
The first two of those grammar classes define the...
more
Read article at Wikipedia
Mildly context-sensitive language
Similar topics in Freebase
-
Regular language
In theoretical computer science, a regular language is a formal language (i.e., a possibly infinite set of finite sequences of symbols from a finite alphabet) that satisfies the following equivalent properties: The collection of regular languages over an alphabet Σ is defined recursively as follows...