Abstract
Right-linear finite path overlapping TRS are shown to effectively preserve recognizability. The class of right-linear finite path overlapping TRS properly includes the class of linear generalized semi-monadic TRS and the class of inverse left-linear growing TRS, which are known to effectively preserve recognizability. Approximations by inverse right-linear finite path overlapping TRS are also discussed.
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
Brained, W.S.: Tree generating regular systems. Inform. and Control 14, 217–231 (1969)
Coquidé, J.L., Dauchet, M., Gilleron, R., Vágvölgyi, S.: Bottom-up tree pushdown automata: classification and connection with rewrite systems. Theoretical Computer Science 127, 69–98 (1994)
Dershowitz, N., Jouannaud, J.-P.: Rewrite Systems. In: Handbook of Theoretical Computer Science. Formal Models and Semantics, vol. B, pp. 243–320. Elsevier Science Publishers, Amsterdam (1990)
Durand, I., Middeldorp, A.: Decidable call by need computations in term rewriting (extended abstract). In: McCune, W. (ed.) CADE 1997. LNCS (LNAI), vol. 1249, pp. 4–18. Springer, Heidelberg (1997)
Gécseq, F., Steinby, M.: Tree Automata. Académiai Kiadó (1984)
Gilleron, R.: Decision problems for term rewriting systems and recognizable tree languages. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol. 480, pp. 148–159. Springer, Heidelberg (1991)
Gilleron, R., Tison, S.: Regular tree languages and rewrite systems. Fundamenta Informaticae 24, 157–175 (1995)
Gyenizse, P., Vágvölgyi, S.: Linear generalized semi-monadic rewrite systems effectively preserve recognizability. Theoretical Computer Science 194, 87–122 (1998)
Huet, G., Lévy, J.-J.: Computations in Orthogonal Rewriting Systems. In: Computational Logic, Essays in Honor of Alan Robinson, ch. I and II, pp. 396–443. MIT Press, Cambridge (1991)
Jacquemard, F.: Decidable approximations of term rewriting systems. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol. 1103, pp. 362–376. Springer, Heidelberg (1996)
Kaji, Y., Fujiwara, T., Kasami, T.: Solving a unification problem under constrained substitutions using tree automata. J. of Symbolic Computation 23(1), 79–117 (1997)
Nagaya, T., Toyama, Y.: Decidability for left-linear growing term rewriting systems. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol. 1631, pp. 256–270. Springer, Heidelberg (1999)
Salomaa, K.: Deterministic tree pushdown automata and monadic tree rewriting systems. J. Comput. System Sci. 37, 367–394 (1988)
Takai, T., Kaji, Y., Tanaka, T., Seki, H.: A procedure for solving an order-sorted unification problem - extension for left-nonlinear system. Technical Report of NAIST. NAIST-IS-TR98011 (1998), available at http://www.aist-nara.ac.jp/
Takai, T., Kaji, Y., Seki, H.: A sufficient condition for the termination of the procedure for solving an order-sorted unification problem. Technical Report of NAIST. NAIST-IS-TR99010 (1999), available at http://www.aist-nara.ac.jp/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Takai, T., Kaji, Y., Seki, H. (2000). Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability. In: Bachmair, L. (eds) Rewriting Techniques and Applications. RTA 2000. Lecture Notes in Computer Science, vol 1833. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721975_17
Download citation
DOI: https://doi.org/10.1007/10721975_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67778-9
Online ISBN: 978-3-540-44980-5
eBook Packages: Springer Book Archive