{'fraction_non_alphanumeric': 0.019417475728155338, 'fraction_numerical': 0.0, 'mean_word_length': 5.535211267605634, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Descriptional Complexity of Restricted CD Grammar Systems

The problem is addressed to what extent cooperating distributed (CD) grammar systems with metalinear components are more succinct than metalinear grammars when describing metalinear languages. As measures of sufficientness, the number of variables, the number of productions and the total number of symbols are considered. It is shown that CD grammar systems can achieve the best possible increase of efficiency compared with metalinear grammars with respect to all the three measures and in case of almost all derivation modes. Regarding the numbers of variables and productions, these results remain valid even in comparison with context-free grammars. Finally, the known results for unrestricted context-free CD grammar systems in comparison with context-free grammars are supplemented with respect to another derivation mode, namely the full competence (sf-) mode.