On the Generative Capacity of Certain Classes of Cooperating Grammar Systems
暂无分享,去创建一个
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.)
[1] Gheorghe Paun,et al. Regulated Rewriting in Formal Language Theory , 1989 .
[2] Gheorghe Paun,et al. Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.
[3] Erzsébet Csuhaj-Varjú,et al. On Cooperating/Distributed Grammar Systems , 1990, J. Inf. Process. Cybern..
[4] Arto Salomaa,et al. Formal languages , 1973, Computer science classics.
[5] Grzegorz Rozenberg,et al. The mathematical theory of L systems , 1980 .