On The Generative Capacity Of Certain Classes Of Cooperating Grammar Systems

Authors:
Jürgen Dassow;Gheorghe Paun;Sorina Vicolov
Affiliations:
Otto-von-Guericke-University Magdeburg, Department of Mathematics PSF 4120, D-39016 Magdeburg, Germany;(Research supported by Alexander von Humboldt Foundation) Institute of Mathematics of the Romanian Academy of Sciences Str. Academiei 14, B-70109 Bucuresti, Romania;Institute of Mathematics of the Romanian Academy of Sciences Str. Academiei 14, B-70109 Bucuresti, Romania
Venue:
Fundamenta Informaticae
Year:
1995

Citing 5
Cited 1

Formal languages

Formal languages
On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
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

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

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper looks for necessary conditions for a language to be generated by a cooperating distributed grammar system with modes = k and ≥ k of derivation. It is proved that the length set of such languages contains infinite arithmetical progressions. Some consequences of this result are derived, concerning the power of these grammars and the closure properties of the corresponding families. Then, one proves that these systems can generate non-semi-linear languages. (Both these questions were formulated as open problems in the field literature.)