metalinear language
Recall that a linear grammar is a formal grammar $G=(\mathrm{\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 $\mathrm{\Sigma}$, with at most one occurrence of a nonterminal symbol.
The concept^{} of a linear grammar can be generalized: define a $k$linear grammar as a formal grammar $G=(\mathrm{\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 nonterminal symbols, $u,v$ are terminal words, and $W$ is a word over $\mathrm{\Sigma}$ with no more than $k$ occurrences of nonterminal symbols, and none of which is the start symbol $\sigma $. Any $k$linear grammar is contextfree.
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 $\mathcal{L}(k)$ denotes the family of $k$linear languages, then the family $\mathcal{L}(\mathrm{\infty})$ of metalinear langauges is
$$\mathcal{L}(\mathrm{\infty})=\bigcup \{\mathcal{L}(k)\mid k\ge 1\}.$$ 
It is easy to see we have the following inclusions
$$\mathcal{R}\subseteq \mathcal{L}(k)\subseteq \mathrm{\cdots}\subseteq \mathcal{L}(k)\subseteq \mathrm{\cdots}\subseteq \mathcal{L}(\mathrm{\infty})\subseteq \mathcal{F}$$ 
where $\mathcal{R}$ and $\mathcal{F}$ are the families of regular^{} and contextfree 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 contextfree languages.
References
 1 A. Salomaa, Formal Languages, Academic Press, New York (1973).
Title  metalinear language 

Canonical name  MetalinearLanguage 
Date of creation  20130322 18:57:09 
Last modified on  20130322 18:57:09 
Owner  CWoo (3771) 
Last modified by  CWoo (3771) 
Numerical id  8 
Author  CWoo (3771) 
Entry type  Definition 
Classification  msc 68Q45 
Classification  msc 68Q70 
Related topic  LinearGrammar 
Related topic  LinearLanguage 
Defines  $k$linear language 