Abstract
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be arbitrarily faraway. In particular, it is equipped with an (dis)equality relation on states, so that whenever two subtrees t and t′ evaluate (in an accepting run) to two states which are in the (dis)equality relation, they must be (dis)equal. We study several properties of TAGEDs, and prove decidability of emptiness of several classes. We give two applications of TAGEDs: decidability of an extension of Monadic Second Order Logic with tree isomorphism tests and of unification with membership constraints. These results significantly improve the results of [10].
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
Aiken, A., Kozen, D., Wimmers, E.L.: Decidability of systems of set constraints with negative constraints. Information and Computation 122(1), 30–44 (1995)
Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231–240 (2005)
Bogaert, B., Tison, S.: Equality and disequality constraints on direct subterms in tree automata. In: Finkel, A., Jantzen, M. (eds.) STACS 1992. LNCS, vol. 577, pp. 161–171. Springer, Heidelberg (1992)
Charatonik, W.: Automata on dag representations of finite trees. Technical report (1999)
Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: IEEE Symposium on Foundations of Computer Science (1994)
Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. TCS 331(1), 143–214 (2005)
Comon, H., Dauchet, M., Gilleron, R., Löding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (2007), http://www.grappa.univ-lille3.fr/tata
Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation 112(2), 167–216 (1994)
Dauchet, M., Caron, A.-C., Coquidé, J.-L.: Reduction properties and automata with constraints. JSC 20, 215–233 (1995)
Filiot, E., Talbot, J.-M., Tison, S.: Satisfiability of a spatial logic with tree variables. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol. 4646, pp. 130–145. Springer, Heidelberg (2007)
Gilleron, R., Tison, S., Tommasi, M.: Some new decidability results on positive and negative set constraints. In: Proceedings of the International Conference on Constraints in Computational Logics, pp. 336–351 (1994)
Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Research Report, LSV, ENS Cachan (2006)
Karianto, W., Löding, C.: Unranked tree automata with sibling equalities and disequalities. Research Report, RWTH Aachen (2006)
Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-pattern matching. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421. Springer, Heidelberg (2007)
Kutsia, T., Marin, M.: Solving regular constraints for hedges and contexts. In: UNIF 2006, pp. 89–107 (2006)
Libkin, L.: Logics over unranked trees: an overview. LMCS 2006 3(2), 1–31 (2006)
Mongy, J.: Transformation de noyaux reconnaissables d’arbres. Forêts RATEG. PhD thesis, Université de Lille (1981)
Murata, M.: Hedge automata: A formal model for xml schemata. Technical report, Fuji Xerox Information Systems (1999)
Neven, F.: Automata, logic, and XML. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol. 2471, pp. 2–26. Springer, Heidelberg (2002)
Schwentick, T.: Automata for XML – a survey. J. Comput. Syst. Sci. 73(3), 289–315 (2007)
Stefansson, K.: Systems of set constraints with negative constraints are nexptime-complete. In: LICS (1994)
Thatcher, J.W., Wright, J.B.: Generalized finite automata with an application to a decision problem of second-order logic. Mathematical System Theory 2, 57–82 (1968)
Full paper version, http://hal.inria.fr/inria-00292027
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Filiot, E., Talbot, JM., Tison, S. (2008). Tree Automata with Global Constraints. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2008. Lecture Notes in Computer Science, vol 5257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85780-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-85780-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-85779-2
Online ISBN: 978-3-540-85780-8
eBook Packages: Computer ScienceComputer Science (R0)