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
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
Mathematical Theory of L Systems
Mathematical Theory of L Systems
A note on cooperating distributed grammar systems working in combined modes
Information Processing Letters
Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
Language and Automata Theory and Applications
On active symbols in CD grammar systems
Journal of Automata, Languages and Combinatorics
| Hi-index | 0.00 |
It is proved that the number of components in context-free cooperating distributed (CD) grammar systems can be reduced to 3 when they are working in the so-called sf-mode of derivation, which is the cooperation protocol which has been considered first for CD grammar systems, in this derivation mode, a component continues the derivation until and unless there is a nonterminal in the sentential form which cannot be rewritten according to that component. Moreover, it is shown that CD grammar systems in sf-mode with only one component can generate only the context-free languages but they can generate non-context-free languages if two components are used. The sf-mode of derivation is compared with other well-known cooperation protocols with respect to the hierarchies induced by the number of components.