We study several aspects of language classes between linear and context-free, namely, hierarchical aspects, closure properties and normal forms. We show how to apply such normal form results to matrix grammars with quite restricted nonterminal complexity. © Institut für Informatik · Justus-Liebig-Universität Giessen.