The notion of a grammar form is extended to context-free matrix grammars yielding so-called matrix forms. Their reduction and completeness properties are studied and some normal-form results and complete matrix forms are presented. The closure properties of language families ℒ( F ) obtained from a matrix form F are also examined. The type of interpretation applied here corresponds to strict interpretations of ordinary context-free grammar forms.