Abstract
In this paper the context-splittable normal form for rewritings systems defining Church-Rosser languages is introduced. Context-splittable rewriting rules look like rules of context-sensitive grammars with swapped sides. To be more precise, they have the form uvw → uxw with u, v, w being words, v being nonempty and x being a single letter or the empty word. It is proved that this normal form can be achieved for each Church-Rosser language and that the construction is effective.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Beaudry, M. Holzer, G. Niemann, and F. Otto. MacNaughton languages. Technical Report Mathematische Schriften Kassel, No. 26/00, Universität Kassel, November 2000.
R. V. Book and C O’Dunlaing. Testing for the Church-Rosser property. Theoretical Computer Science, 16:223–229, 1981.
G. Buntrock and F. Otto. Growing context-sensitive languages and Church-Rosser languages. Information and Computation, 141:1–36, 1998.
R.V. Book. Confluent and other types of Thue systems. JACM, 29:171–182, 1982.
G. Buntrock. Wachsende kontext-sensitive Sprachem. Habilitationsschrift, Fakultät für Mathematik und Informatik, Universitüt Würzburg, Juli 1996.
N. Chomsky. On certain formal properties of grammars. Information and Control, 2(2):137–167, June 1959.
E. Dahlhaus and M.K. Warmuth. Membership for growing context-sensitive grammars is polynomial. Journal of Computer and System Sciences, 33:456–472, 1986.
M. Jantzen. Confluent String Rewriting. Springer-Verlag, 1988.
R. McNaughton. An insertion into the Chomsky hierarchy? In J. Karhumäki, H. A. Maurer, G. Paŭn, and G. Rozenberg, editors, Jewels are Forever, Contributions on Theoretical Computer Science in Honour of Arto Salomaa, pages 204–212. Springer-Verlag, 1999.
R. McNaughton, P. Narendran, and F. Otto. Church-Rosser Thue systems and formal languages. Journal Association Computing Machinery, 35:324–344, 1988.
G. Niemann and F. Otto. The Church-Rosser languages are the deterministic variants of the growing context-sensitive languages. In M. Nivat, editor, Foundations of Software Sscience and Computation Structures, Proceedings FoSSaCS’98, volume 1378 of LNCS, pages 243–257, Berlin, 1998. Springer-Verlag.
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, volume 1232 of LNCS, pages 53–67, Berlin, 1997. Springer-Verlag.
J. R. Woinowski. A normal form for Church-Rosser language systems. Report, TU-Darmstadt, http://www.iti.informatik.tu-darmstadt.de/~woinowsk/, June 2000.
J. R. Woinowski. Prefix languages of Church-Rosser languages. In Proceedings of FST-TCS 2000 (Foundations of Software Technology/Theoretical Computer Science), Lecture Notes in Computer Science. Springer-Verlag, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woinowski, J.R. (2001). A Normal Form for Church-Rosser Language Systems. In: Middeldorp, A. (eds) Rewriting Techniques and Applications. RTA 2001. Lecture Notes in Computer Science, vol 2051. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45127-7_24
Download citation
DOI: https://doi.org/10.1007/3-540-45127-7_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42117-7
Online ISBN: 978-3-540-45127-3
eBook Packages: Springer Book Archive