Abstract
For a constructor-based rewrite system R, a regular set of ground terms E, and assuming some additional restrictions, we build a finite tree automaton that recognizes the descendants of E, i.e. the terms issued from E by rewriting, according to innermost, innermost-leftmost, and outermost strategies.
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
H. Comon. Sequentiality, second order monadic logic and tree automata. In Proc., Tenth Annual IEEE Symposium on logic in computer science, pages 508–517. IEEE Computer Society Press, 26–29 June 1995.
H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata techniques and Applications (TATA). http://l3ux02.univ-lille3.fr/tata.
J. Coquidé, M. Dauchet, R. Gilleron, and S. Vagvolgyi. Bottom-up Tree Pushdown Automata and Rewrite Systems. In R. V. Book, editor, Proceedings 4th Conference on Rewriting Techniques and Applications, Como (Italy), volume 488 of LNCS, pages 287–298. Springer-Verlag, April 1991.
M. Dauchet, A.C. Caron, and J.L. Coquidé. Reduction Properties and Automata with Constraints. In Journal of Symbolic Computation, 20:215–233. 1995.
M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In Proc., Fifth Annual IEEE Symposium on logic in computer science, pages 242–248, Philadelphia, Pennsylvania, 1990. IEEE Computer Society Press.
J. H. Gallier and R. V. Book. Reductions in tree replacement systems. Theoretical Computer Science, 37:123–150, 1985.
T. Genet. Decidable Approximations of Sets of Descendants and Sets of Normal Forms. In Proceedings of 9th Conference on Rewriting Techniques and Applications, Tsukuba (Japan), volume 1379 of LNCS, pages 151–165. Springer-Verlag, 1998.
T. Genet, F. Klay. Rewriting for Cryptographic Protocol Verification. Technical report, CNET-France Telecom, 1999. http://www.loria.fr/genet/Publications/GenetKlay-RR99.ps.
V. Gouranton, P. Réty, and H. Seidl. Synchronized Tree Languages Revisited and New Applications. In Proceedings of FoSSaCs, volume 2030 of LNCS, Springer-Verlag, 2001.
M. Hermann and R. Galbavý. Unification of Infinite Sets of Terms Schematized by Primal Grammars. Theoretical Computer Science, 176, 1997.
F. Jacquemard. Decidable Approximations of Term Rewrite Systems. In H. Ganzinger, editor, Proceedings 7th Conference RTA, New Brunswick (USA), volume 1103 of LNCS, pages 362–376. Springer-Verlag, 1996.
P. Réty. Regular Sets of Descendants for Constructor-based Rewrite Systems. In Proceedings of the 6th international conference on LPAR, Tbilisi (Republic of Georgia), Lecture Notes in Artificial Intelligence. Springer-Verlag, 1999.
P. Réty. J. Vuotto. Regular Sets of Descendants by Leftmost Strategy. Research Report RR-2002-08 LIFO, 2002.
K. Salomaa. Deterministic Tree Pushdown Automata and Monadic Tree Rewriting Systems. The journal of Computer and System Sciences, 37:367–394, 1988.
T. Takai, Y. Kaji, and H. Seki. Right-linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. In L. Bachmair, editor, Proceedings 11th Conference RTA, Norwich (UK), volume 1833 of LNCS, pages 246–260. Springer-Verlag, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Réty, P., Vuotto, J. (2002). Regular Sets of Descendants by Some Rewrite Strategies. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_10
Download citation
DOI: https://doi.org/10.1007/3-540-45610-4_10
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43916-5
Online ISBN: 978-3-540-45610-0
eBook Packages: Springer Book Archive