Some Remarks on Networks of Parallel Language Processors

Authors:
Jürgen Dassow
Affiliations:
-
Venue:
RSCTC '98 Proceedings of the First International Conference on Rough Sets and Current Trends in Computing
Year:
1998

Citing 5
Cited 0

Grammar systems

Handbook of formal languages, vol. 2
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
Developmental Systems and Languages

Developmental Systems and Languages
Networks of Parallel Language Processors

New Trends in Formal Languages - Control, Cooperation, and Combinatorics (to Jürgen Dassow on the occasion of his 50th birthday)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks of parallel language processors form a special type of grammar systems where derivation steps in the mode of L systems and communication steps alternate. We prove that, given an arbitrary system, an equivalent system with at most three components can be constructed. This improves a result of [2]. Furthermore we consider the function f(m) which gives the number of words generated in m steps. We relate this function to growth functions of D0L systems and prove the undecidability of the equivalence with respect to this function.