Descriptional Complexity of Matrix Simple Semi-conditional Grammars

International audienceMatrix grammars are one of the first approaches ever proposed in regulated rewriting, prescribing that rules have to be applied in a certain order. Typical descriptional complexity measures incorporate the number of nonterminals or the length, i.e., the number of rules per matrix. In simple semi-conditional (SSC) grammars, the derivations are controlled by a permitting string or by a forbidden string associated to each rule. The maximum length i of permitting strings and the maximum length j of forbidden strings are called the degree of such grammars. Matrix SSC grammars (MSSC) put matrix grammar control on SSC rules. We consider the computational completeness of MSSC grammars with degrees (2, 1), (2, 0) and (3, 0). The results are important in the following aspects. (i) With permitting strings alone, it is unknown if SSC grammars are computational complete, while MSSC grammars describe $$\textsf {RE}$$ even with severe further restrictions on their descriptional complexity. (ii) Matrix grammars with appearance checking with three nonterminals are computationally complete; however, the length is unbounded. With our constructions for MSSC grammars, we can even bound the length