Remarks on the Relationship Between Cooperating Distributed Grammar Systems and Lindenmayer Systems

Authors:
Mohamed Amin
Affiliations:
(Correspd.) Department of Mathematics and Computer Science, Faculty of Science, El.Menoufia University, Shebin Elkom, Egypt. Science@shebin.eun.eg
Venue:
Fundamenta Informaticae
Year:
1998

Citing 4
Cited 0

Petri net algorithms in the theory of matrix grammars

Acta Informatica
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
Mathematical Theory of L Systems

Mathematical Theory of L Systems
On The Generative Capacity Of Certain Classes Of Cooperating Grammar Systems

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

In [2] it is shown that the family of languages generated by cooperating distributed (CD) grammar systems with context-free components in the derivation modes = k, ≥ k, for k ≥ 2, and the family of E0L languages are incomparable. Because one of the languages used in the proof of the incomparability does not work, we fill here the gap, using another language. We also give an effective procedure for constructing an ET0L system from a given context-free cooperating/distributed (CD) grammar system working in the maximum mode of cooperation.