Abstract
It is shown that nondeterministic logarithmic space-bounded Turing machines recognize exactly the closure (under log-space reduction) of the languages generated by a variant of regular parallel communicating grammars systems.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Balcázar, J. Díaz and J. Gabarró, Structural Complexity I and II, (Springer-Verlag, 1990).
L. Cai, The computational complexity of PCGS with regular components. Proceedings 2nd International Conference on Development in Language Theory, World Sci. Publ., Singapore, 1996, 209–219.
L. Cai, The complexity of linear PCGSs, Computers and Artificial Intelligence, 15, 2–3 (1996), pp. 199–210.
S. Cook, A Taxonomy of problems with fast parallel algorithms, Information and Control, 64 (1985), 2–22.
E. Csuhaj-Varjú, J. Dassow, J. Kelemen, and Gh. Păun, Grammar Systems, (Gordon and Breach Sci. Publishers Ltd., 1993).
R. Freund, Gh. Păun, C. Procopiuc and O. Procopiuc, Parallel Communicating Grammar Systems with Context-sensitive Components, Artificial Life: Grammatical Models, Gh. Păun ed. (The Black sea Univ. Press, 1995).
J. E. Hopcroft and J. D. Ullman, Introduction to automata theory, languages and computation (Addison Wesley, 1979).
J. Hromkovič, J. Kari and L. Kari, Some hierarchies for the communication complexity measures of cooperating grammar systems, Theoretical computer Science, 127, 123–147.
J. Hromkovič, J. Kari, L. Kari and J. Pardubská, Two lower bounds on distributive generation of languages, Proc. 19th MFCS'94, Lecture Notes in Computer Science 841, 423–432.
J. Hromkovič and D. Wierzchula, Note on nondeterministic linear time, real time, and parallel communicating grammar systems, manuscript.
D. S. Johnson, A catalog for complexity classes, in: J. van Leeuvan, ed., The handbook of Theoretical Computer Sciences Vol A (Elsevier Science Publishers, 1990), 69–161.
Gh. Păun, On the synchronization in parallel communicating grammar systems, Acta Informatica, 30 (1993), 351–367.
Gh. Păun and L. Santean, Parallel communicating grammar systems: the regular case, Ann. Univ. Buc., Series Matem.-Inform., 38 (1989), 55–63.
Gh. Păun and L. Santean, Further remarks on parallel communicating grammar systems, International Journal on Computing Mathematics, 34 (1990), 187–203.
A. Salomaa, Formal Languages (Academic Press, 1973).
L. Santean, Parallel communicating systems, Bulletin EATCS, 42 (1990), 160–171.
L. Santean and J. Kari, The impact of the number of cooperating grammars on the generative power, Theoretical Computer Science, 98 (1992), 249–262.
I. Sudborough, On the tape complexity of deterministic context-free languages, Journal of ACM, 25 (1978), 405–414.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Abrahamson, K., Cai, L., Gordon, S. (1997). A grammar characterization of logarithmic-space computation. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_17
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive