Handbook of formal languages, vol. 2
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
Hi-index | 0.00 |
Metalinear CD grammar systems are defined to be context-free CD grammar systems where each component consists of metalinear productions. The maximal number of nonterminals in a starting production is the width of a CD grammar system. It will be shown that the width of metalinear CD grammar systems induces an infinite hierarchy of language classes. In addition, it is established that metalinear CD grammar systems of a certain width generate language classes that do not contain all context-free languages but contain some context-sensitive languages. The resulting language classes are closed under union, intersection with regular languages, homomorphism and inverse homomorphism. They are not closed under concatenation, Kleene closure, intersection and complement.