Abstract
We define an extension of tree automata by adding some tests in the rules. The goal is to handle non linearity. We obtain a family which has good closure and decidability properties and we give some applications.
This work was supported, in part, by the ”PRC Mathématiques et Informatique”
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
B. Bogaert: ” Automates d'arbres avec tests d'égalités.”-PhD Thesis, Université de Lille I. (1990)
B.Bogaert, H.Comon & S.Tison: ” Order-sorted calculi with term declarations.”-UNIF'91. (1991)
B.Bogaert, S.Tison: ” Minimization of tree automata with tests”-LIFL Report (to appear) (1991)
H. Comon: ” Unification et Disunification. Théorie et applications.”-PhD Thesis, INPG (Grenoble) (1988)
H. Comon: ” Inductive proofs by specification transformations.”-Proc. Rewriting technics and applications, Chapel-Hill, LNCS 375 (1989)
H. Comon & C. Delor: ” Equational formulae with membership constraints.”-Technical report, LRI Paris-Sud Orsay (1991)
B. Courcelle: ” On recognizable sets and tree automata. Resolutions of equations in algebraic structures.”-Academic Press, Ait-Kaci & M.Nivat ed. (1989)
M. Dauchet & S. Tison: ” Réduction de la non-linéarité des morphismes d'arbres.”-Rapport IT 196, LIFL, Université de Lille (1990)
J.P. Jouannaud & B. Kounalis: ” Automatic proofs by induction in equationnal theory without constructors.”-Proc. 1st IEEE symp. Logic in Computer Science, Cambridge, Mass. (1986)
F. Gécseg & M. Steinby: ” Tree automata.”-Akadémiai Kiadó, Budapest (1984)
D. Kapur, P. Narendran, H. Zhang: ”On sufficient completeness and related properties of term rewriting systems.”-Research Report TR 87-26, Computer science department, State University of New-York at Albany (1985)
E. Kounalis: ” Testing for inductive (co-)reductibility.”-Proc CAAP 90 (1990)
M.J. Maher: ” Complete axiomatizations of the algebras of finite, rationnal and infinite trees.”-Proc 3rd IEEE Symp. Logic in Computer Sc. (1988)
J.Mongy: ” Transformations de noyaux reconnaissables d'arbres. ForÊts RATEG.”-PhD Thesis, Université de Lille I (1981)
M. Oyamagushi: ” The Church-Roser property for ground term rewriting systems is decidable.”-TCS 49, pp 43–79 (1987)
M. Oyamagushi: ” The reachability and joinability problems for right-ground term rewriting systems.”-J. Inf. Process (to appear)
J.W. Thatcher: ” Tree automata: an informal survey.”-Currents in the theory of computing. A.V. Aho ed. Prentice Hall (1973)
M. Schmidt-Schauss: ” Computational aspects of an order-sorted logic with term declarations”-PhD Thesis, Univ. Kaiserlautern (1988)
S. Tison: ” Automates comme outils de décision.”-Mémoire d'Habilitation-Université de Lille (1990)
M. Tommasi: ” Automates avec tests d'égalités entre cousins germains”-LIFL IT-report (to appear) (1991)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bogaert, B., Tison, S. (1992). Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds) STACS 92. STACS 1992. Lecture Notes in Computer Science, vol 577. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55210-3_181
Download citation
DOI: https://doi.org/10.1007/3-540-55210-3_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55210-9
Online ISBN: 978-3-540-46775-5
eBook Packages: Springer Book Archive