Abstract
Growing context-sensitive grammars (GCSG) are investigated. The variable membership problem for GCSG is shown to be NP-complete. This solves a problem posed in [DW86]. It is also shown that the languages generated by GCSG form an abstract family of languages and several implications are presented.
This research was supported by the Alexander-von-Humboldt Foundation while the author visited Würzburg Universität.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Eric W. Allender. Isomorphisms and 1-L reductions. Journal of Computer and System Sciences, 36:336–350, 1988.
Ronald V. Book. On the structure of context-sensitive grammar. International Journal of Computer and Information Sciences, 2:129–139, 1973.
Ronald V. Book. On the complexity of formal grammars. Ada Informatica, 9:171–181, 1978.
Franz-Josef Brandenburg. On one-way auxiliary pushdown automata. In 3rd GI Conference on theoretical computer science, volume 48 of LNCS, pages 132–144. Springer, 1977.
Sang Cho and Dung T. Huynh. Uniform membership for deterministic growing contextsensitive grammars is P-complete. Technical Report UTDCS-5-89, Computer Science Department, University of Texas at Dallas, Richardson, Texas 75083, February 1989.
A.B. Cremers. Normal forms for context-sensitive grammars. Acta Informatica, 3:59–73, 1973.
Elias Dahlhaus and Manfred K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456–472, 1986.
Seymour Ginsburg, Sheila Greibach, and John Hopcroft. Studies in Abstract Families of Languages. Memoir #87, American Mathematical Society, 1969.
A.W. Gladkij. On the complexity of phrase structure grammars. Algebra i Logika Sem., 3:29–44,1964. (in Russian).
Juris Hartmanis, Neil Immerman, and Stephen R. Mahaney. One-way log-tape reductions. In 19th Annual Symposium on Foundations of Computer Science (FOCS), pages 65–71, 1978.
John E. Hopcroft and Jeffrey D. Ullman. Introduction to Automata Theory, Languages and Computation. Addison-Wesley Series in Computer Science. Addison-Wesley, 1979.
Matthias Jantzen. Confluent string rewriting. Springer, 1988.
Clemens Lautemann. One pushdown and a small tape. In Klaus W. Wagner, editor, Dirk Siefkes zum 50. Geburtstag, pages 42–47. Technische Universität Berlin and Universität Augsburg, 1988.
Jacques Loecks. The parsing of general phrase-structure grammars. Information and Control, 16:443–464, 1970.
Leonard Y. Liu and Peter Weiner. An infinite hierarchy of intersections of context-free languages. Mathematical Systems Theory, 7:185–192, 1973.
Paliath Narendran and Karnela Krithivasan. On the membership problem for some grammars. COINS Technical Report CAR-TR-267 & CS-TR-1787 & AFOSR-86-0092, Center for Automation Research, University of Maryland, College Park, MD 20742, March 1987.
Ivan H. Sudborough. On the tape complexity of deterministic context-free languages. Journal of the Association for Computing Machinery, 25:405–414,1978.
H. Venkateswaran. Properties that characterize LOGCFL. Journal of Computer and System Sciences, 43:380–404, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Buntrock, G., Loryś, K. (1992). On growing context-sensitive languages. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_65
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive