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

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.