Abstract
Some undecidability results concerning the property of preserving regularity are presented that strengthen corresponding results of Gilleron and Tison (1995). In particular, it is shown that it is undecidable in general whether a finite, length-reducing, and confluent stringre-writing system yields a regular set of normal forms for each regular language.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Anissimov. Group languages. Cybernetics, 7:594–601, 1971.
R.V. Book and F. Otto. String-Rewriting Systems. Springer-Verlag, New York, 1993.
W.J. Brainerd. Tree generating regular systems. Information and Control, 14:217–231, 1969.
J.-L. Coquidé, M. Dauchet, R. Gilleron, and S. Vágvölgyi. Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science, 127:69–98, 1994.
R. Gilleron. Decision problems for term rewriting systems and recognizable tree languages. In C. Choffrut and M. Jantzen, editors, Proc. of STACS'91, Lecture Notes in Computer Science 480, pages 148–159. Springer-Verlag, 1991.
S. Greibach. A note on pushdown store automata and regular systems. Proc. American Mathematical Society, 18:263–268, 1967.
F. Gécseg and M. Steinby. Tree Automata. Akadémiai Kiadó, Budapest, 1984.
R. Gilleron and S. Tison. Regular tree languages and rewrite systems. Fundamenta Informaticae, 24:157–175, 1995.
P. Gyenizse and S. Vágvölgyi. Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science, 1997. to appear.
P.K. Hooper. The undecidability of the Turing machine immortality problem. J. Symbolic Logic, 31:219–234, 1966.
A.J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semiunification problem. Information and Computation, 102:83–101, 1993.
R.C. Lyndon and P.E. Schupp. Combinatorial Group Theory. Springer-Verlag, Berlin, 1977.
K. Madlener and F. Otto. Groups presented by certain classes of finite length-reducing string-rewriting systems. In P. Lescanne, editor, Rewriting Techniques and Applications, Lecture Notes in Computer Science 256, pages 133–144. Springer-Verlag, Berlin, 1987.
F. Otto. When is an extension of a specification consistent? Decidable and undecidable cases. Journal of Symbolic Computation, 12:255–273, 1991.
F. Otto. Preserving regularity and related properties of string-rewriting systems. Mathematische Schriften Kassel 6/96, Universität-GH Kassel, September 1996.
J. Sakarovitch. Syntaxe des langages de Chomsky, essai sur le déterminisme, 1979. Thèse de doctorat d'état de l'université Paris VII.
K. Salomaa. Deterministic tree pushdown automata and monadic tree rewriting systems. Journal of Computer and System Sciences, 37:367–394, 1988.
G. Sénizergues. Some decision problems about controlled rewriting systems. Theoretical Computer Science, 71:281–346, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Otto, F. (1997). On the property of preserving regularity for string-rewriting systems. In: Comon, H. (eds) Rewriting Techniques and Applications. RTA 1997. Lecture Notes in Computer Science, vol 1232. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62950-5_63
Download citation
DOI: https://doi.org/10.1007/3-540-62950-5_63
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62950-4
Online ISBN: 978-3-540-69051-1
eBook Packages: Springer Book Archive