Abstract
The lower bounds on communication complexity measures of language generation by Parallel Communicating Grammar Systems (PCGS) are investigated. The first result shows that there exists a language that can be generated by some dag-PCGS (PCGS with communication structures realizable by directed acyclic graphs) consisting of 3 grammars, but by no PCGS with tree communication structure. The second result shows that dag-PCGS have their communication complexity of language generation either constant or linear.
These authors were partially supported by MSV SR grant and by EC Cooperative Action IC 1000: project ALTEC.
The work of this author has been supported by Project 11281 of the Academy of Finland.
The part of the work of this author has been done during the author's stay at the Dept. of Mathematics & Informatics of the University of Paderborn.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Gh.Paun, L.Santean: Parallel communicating grammar systems: the regular case. Ann.Univ.Buc.Ser.Mat.-Inform. 37 vol. 2(1989), pp. 55–63.
J.E.Hopcroft, J.D.Ullman: Formal Languages and Their Relation to Automata. Addison-Wesley Publishing Company, Reading, Massachusetts, 1969.
G.T.Herman, G.Rozenberg: Developmental Systems and Languages, North-Holland, Amsterdam, 1975.
J.Hromković, J.Kari, L.Kari: Some hierarchies for the communication complexity measures of cooperating grammar systems. Theoretical Computer Science, to appear (extended abstract in: Proc. of the MFCS'93 Lecture Notes in Comp. Science 711, pp. 495–505).
M.Lukáč: About two communication structures of PCGS. Master Thesis(1992), Dept.of Comp.Sci., Faculty of Mathematics and Physics, Comenius University, Bratislava (in Slovak).
D.Pardubská: The communication complexity hierarchy of parallel communicating systems. Presented at IMYCS'92.
D.Pardubská: On the power of communication structure for distributive generation of languages. In: Developments in Language Theory. Preproceedings, University of Turku, Turku 1993, pp. 30–32.
G.Rozenberg, A.Salomaa: The Mathematical Theory of L Systems. Academic Press, 1980.
L.Santean: Parallel Communicating Systems. EATCS Bulletin, Num.42 (1990), 160–171.
L.Santean, J.Kari: The impact of the number of cooperative grammars on the generative power, Theoretical Computer Science 98(1992) pp. 249–263.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hromkovič, J., Kari, J., Kari, L., Pardubská, D. (1994). Two lower bounds on distributive generation of languages. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_89
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive