Abstract
The growing context-sensitive languages have been classified through the shrinking two-pushdown automaton, the deterministic version of which characterizes the class of generalized Church-Rosser languages (Buntrock and Otto 1995). Exploiting this characterization we prove that this latter class coincides with the class of Church-Rosser languages that was introduced by McNaughton, Narendran, and Otto (1988). Based on this result several open problems of McNaughton et al can be answered.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R.V. Book. Grammars with Time Functions. PhD thesis, Harvard University, Cambridge, Massachusetts, February 1969.
R.V. Book. Confluent and other types of Thue systems. J. Association Computing Machinery, 29:171–182, 1982.
R.V. Book and F. Otto.String-Rewriting Systems. Springer-Verlag, New York, 1993.
G. Buntrock. Wachsende kontext-sensitive Sprachen. Habilitationsschrift, Fakultät für Mathematik und Informatik, Universität Würzburg, July 1996.
G. Buntrock and K. LoryŚ. On growing context-sensitive languages. In W. Kuich, editor, Proc. of 19th ICALP, Lecture Notes in Computer Science 623, pages 77–88. Springer-Verlag, Berlin, 1992.
G. Buntrock and K. LoryŚ. The variable membership problem: Succinctness versus complexity. In P. Enjalbert, E.W. Mayr, and K.W. Wagner, editors, Proc. of 11th STACS, Lecture Notes in Computer Science 775, pages 595–606. Springer-Verlag, Berlin, 1994.
G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages.In E.W. Mayr and C. Puech, editors, Proc. of 12th STACS, Lecture Notes in Computer Science 900, pages 313–324. Springer-Verlag, Berlin, 1995.
E. Dahlhaus and M. Warmuth. Membership for growing context-sensitive grammars is polynomial. J. Computer System Sciences, 33:456–472, 1986.
A.W. Gladkij. On the complexity of derivations for context-sensitive grammars. Algebri i Logika Sem., 3:29–44, 1964. In Russian.
J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading, M.A., 1979.
R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. J. Association Computing Machinery, 35:324–344, 1988.
F. Otto, M. Katsura, and Y. Kobayashi. Cross-sections for finitely presented monoids with decidable word problems. In H. Comon, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 1232, pages 53–67. Springer-Verlag, Berlin, 1997.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Niemann, G., Otto, F. (1998). The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In: Nivat, M. (eds) Foundations of Software Science and Computation Structures. FoSSaCS 1998. Lecture Notes in Computer Science, vol 1378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053554
Download citation
DOI: https://doi.org/10.1007/BFb0053554
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64300-5
Online ISBN: 978-3-540-69720-6
eBook Packages: Springer Book Archive