|
Recall that a linear grammar is a formal grammar $G=(\Sigma, N,P,\sigma)$ whose productions are of the form $A\to x$ , where $A$ is a terminal symbol, and $x$ is a word over $\Sigma$ , with at most one occurrence of a non-terminal symbol.
The concept of a linear grammar can be generalized: define a $k$ -linear grammar as a formal grammar $G=(\Sigma, N,P,\sigma)$ such that every production in $P$ has one of the three following forms:
- $A\to u$ ,
- $A\to uBv$ ,
- $\sigma \to W$ ,
where $A,B$ are non-terminal symbols, $u,v$ are terminal words, and $W$ is a word over $\Sigma$ with no more than $k$ occurrences of non-terminal symbols, and none of which is the start symbol $\sigma$ . Any $k$ -linear grammar is context-free.
A language is said to be $k$ -linear if it can be generated by a $k$ -linear grammar. Note that a language is $1$ -linear iff it is linear.
A language is said to be metalinear if it is $k$ -linear for some positive integer $k$ . In other words, if
 denotes the family of $k$ -linear languages, then the family
 of metalinear langauges is
It is easy to see we have the following inclusions
where
 and
 are the families of regular and context-free languages respectively.
In fact, it can be shown that all of the inclusions above are strict, providing us with an infinite chain of families of languages between the regular languages and the context-free languages.
- 1
- A. Salomaa, Formal Languages, Academic Press, New York (1973).
|
