General grammars that generate their sentences through derivation trees satisfying certain restrictions can be shown to generate k-linear or regular languages.
