On cooperating/distributed grammar systems
Journal of Information Processing and Cybernetics
On competence and completeness in CD grammar systems
Acta Cybernetica - Special issue: selected papers of the workshop grammar systems: recent results and perspectives, Budapest, July 1996
Handbook of formal languages, vol. 2
Remarks on regulated limited ET0L systems and regulated context-free grammars
Theoretical Computer Science
Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization
Theoretical Computer Science
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Regulated Rewriting in Formal Language Theory
Regulated Rewriting in Formal Language Theory
On the number of components in cooperating distributed grammar systems
Theoretical Computer Science - Descriptional complexity of formal systems
On erasing productions in random context grammars
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Left Random Context ET0L Grammars
Fundamenta Informaticae
| Hi-index | 0.00 |
It is well known that certain language families generated by cooperating distributed (CD) grammar systems can be characterized in terms of context-free random context grammars. In particular, the language families generated by CD grammar systems working in the t- and -modes of derivation obey a characterization in terms of ET0L systems, or equivalently by context-free disjoint forbidding random context grammars, and of context-free random context grammars with appearance checking, respectively. Now the question arises whether or not other random context like language families can be characterized in terms of CD grammar systems. We positively answer this question, proving that there are derivation modes for CD grammar systems, namely the negated versions of the aforementioned modes, which precisely characterize the family of context-free disjoint forbidding random context languages and that of languages generated by context-free random context grammars without appearance checking. In passing we show that every language generated by a context-free random context grammar without appearance checking can also be generated by a context-free recurrent programmed grammar without appearance checking, and vice versa.