The emptiness problem for tree automata with global constraints

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2010, Pages 263-272

  Barguñó, Luis ^a   Creus, Carles ^a   Godoy, Guillem ^a   Jacquemard, Florent ^b   Vacher, Camille ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b CNRS   (France)

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS; ROBOTS;

ARITHMETIC CONSTRAINTS; CARDINALITIES; EMPTINESS PROBLEM; GLOBAL CONSTRAINTS; KEY CONSTRAINTS; MONADIC SECOND-ORDER LOGIC; ORDERED TREE; TREE AUTOMATA;

FORESTRY;

EID: 78449284690     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2010.28     Document Type: Conference Paper

References (28)

1. E. Filiot, J.-M. Talbot, and S. Tison, "Tree Automata with Global Constraints," in 12th International Conference in Developments in Language Theory (DLT 2008), ser. Lecture Notes in Computer Science, vol. 5257. Springer, 2008, pp. 314-326.
2. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, C. Löding, D. Lugiez, S. Tison, and M. Tommasi, Tree Automata Techniques and Applications. http://tata.gforge.inria.fr, 2007.
3. A. Bouajjani and T. Touili, "On computing reachability sets of process rewrite systems," in Proceedings of the 16th International Conference on Term Rewriting and Applications (RTA 2005), ser. Lecture Notes in Computer Science, vol. 3467. Springer, 2005, pp. 484-499.
4. K. N. Verma and J. Goubault-Larrecq, "Alternating Two-Way AC-Tree Automata," Inf. Comput., vol. 205, no. 6, pp. 817-869, 2007.
5. G. Feuillade, T. Genet, and V. Viet Triem Tong, "Reachability Analysis over Term Rewriting Systems," Journal of Automated Reasoning, vol. 33 (3-4), pp. 341-383, 2004.
6. T. Schwentick, "Automata for XML - A Survey," J. Comput. Syst. Sci., vol. 73, no. 3, pp. 289-315, 2007.
7. J. Mongy, "Transformation de noyaux reconnaissables d'arbres. forêts rateg," Ph.D., Laboratoire d'Informatique Fondamentale de Lille, Université des Sciences et Technologies de Lille, Villeneuve d'Ascq, France, 1981.
8. B. Bogaert and S. Tison, "Equality and Disequality Constraints on Direct Subterms in Tree Automata," in 9th Symp. on Theoretical Aspects of Computer Science (STACS 1992), ser. LNCS, vol. 577. Springer, 1992, pp. 161-171.
9. E. Filiot, J.-M. Talbot, and S. Tison, "Satisfiability of a Spatial Logic with Tree Variables," in Proceedings of the 21st International Workshop on Computer Science Logic (CSL 2007), ser. Lecture Notes in Computer Science, vol. 4646. Springer, 2007, pp. 130-145.
10. L. Barguñó, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher, "The Emptiness Problem for Tree Automata with Global Constraints," available at www.lsi.upc.edu/~ggodoy/publications.html.
11. F. Jacquemard, F. Klay, and C. Vacher, "Rigid tree automata," in Proceedings of the 3rd International Conference on Language and Automata Theory and Applications (LATA 2009), ser. Lecture Notes in Computer Science, vol. 5457. Springer, 2009, pp. 446-457.
12. K. Wong and C. Löding, "Unranked Tree Automata with Sibling Equalities and Disequalities," in In Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2007), ser. LNCS, vol. 4596. Springer, 2007, pp. 875-887.
13. C. Löding and K. Wong, "On Nondeterministic Unranked Tree Automata with Sibling Constraints," in In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2009), ser. Leibniz International Proceedings in Informatics. Schloss Dagstuhl - Leibniz Center for Informatics, 2009.
14. W. Charatonik, "Automata on DAG Representations of Finite Trees," Max-Planck-Institut für Informatik, Saarbrücken, Germany, Tech. Rep. MPI-I-99-2-001, 1999.
15. S. Anantharaman, P. Narendran, and M. Rusinowitch, "Closure Properties and Decision Problems of DAG Automata," Inf. Process. Letters, vol. 94, no. 5, pp. 231-240, 2005.
16. H. Comon and V. Cortier, "Tree Automata with one Memory, Set Constraints and Cryptographic Protocols," Theoretical Computer Science, vol. 331, no. 1, pp. 143-214, Feb. 2005. [Online]. Available: http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/ComonCortierTCS1.ps
17. H. Seidl, T. Schwentick, and A. Muscholl, "Numerical Document Queries," in Principle of Databases Systems (PODS 2003). ACM Press, 2003, pp. 155-166.
18. S. Dal Zilio and D. Lugiez, "XML Schema, Tree Logic and Sheaves Automata," Journal Applicable Algebra in Engineering, Communication and Computing, vol. 17, no. 5, pp. 337-377, 2006.
19. F. Klaedtke and H. Ruess, "Parikh Automata and Monadic Second-Order Logics with Linear Cardinality Constraints", Intitute of Computer Science at Freiburg University, Tech. Rep. 177, 2002.
20. F. Baader and T. Nipkow, Term Rewriting and All That. New York: Cambridge University Press, 1998.
21. 0? A Survey of Some Results in Proof Theory," Annals of Pure Applied Logic, vol. 53, no. 3, pp. 199-260, 1991.
22. M. Bojanczyk, A. Muscholl, T. Schwentick, and L. Segoufin, "Two-Variable Logic on Data Trees and Applications to XML Reasoning," JACM, vol. 56, no. 3, 2009, a preliminary version was presented at PODS 2006.
23. M. Murata, "Hedge Automata: a Formal Model for XML Schemata," Fuji Xerox INformation Systems, Tech. Rep., 1999.
24. J. W. Thatcher and J. B. Wright, "Generalized Finite Automata Theory with an Application to a Decision Problem of Second-Order Logic," Mathematical System Theory, vol. 2, pp. 57-82, 1968.
25. th Symp. Foundations of Computer Science, 1994, pp. 642-653.
26. R. Gilleron, S. Tison, and M. Tommasi, "Some New Decidability Results on Positive and Negative Set Constraints." in Proceedings, First International Conference on Constraints in Computational Logics, ser. LNCS, vol. 845. Spinger, 1994, pp. 336-351.
27. L. Segoufin, "Automata and Logics for Words and Trees over an Infinite Alphabet," in Computer Science Logic, ser. LNCS, vol. 4207. Springer, 2006.
28. M. Jurdzinski and R. Lazic, "Alternation-Free Modal mu-Calculus for Data Trees," in Proceedings 22nd IEEE Symposium on Logic in Computer Science (LICS). IEEE Computer Society, 2007, pp. 131-140.