Tree automata with global constraints

International Journal of Foundations of Computer Science

Volumn 21, Issue 4, 2010, Pages 571-596

  Filiot, Emmanuel ^a   Talbot, Jean Marc ^b   Tison, Sophie ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b AIX MARSEILLE UNIVERSITY   (France)

^c UNIV LILLE   (France)

Author keywords

automata; equality constraints; Trees

Indexed keywords

EID: 77955585279     PISSN: 01290541     EISSN: None     Source Type: Journal    
DOI: 10.1142/S012905411000743X     Document Type: Conference Paper

References (23)

1. A. Aiken, D. Kozen, and E. L. Wimmers. Decidability of systems of set constraints with negative constraints. Information and Computation, 122(1):30-44, 1995.
2. S. Anantharaman, P. Narendran, and M. Rusinowitch. Closure properties and decision problems of dag automata. Information Processing Letters, 94(5):231-240, 2005.
3. L. Bargũn̈o, C. Creus, G. Godoy, F. Jacquemard, and C. Vacher. The emptiness problem for tree automata with global constraints. In IEEE Symposium on Logic in Computer Science (LICS), 2010. To appear.
4. B. Bogaert and S. Tison. Equality and disequality constraints on direct subterms in tree automata. In 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS), volume 577 of LNCS, pages 161-171, 1992.
5. L. Cardelli and G. Ghelli. TQL: A Query Language for Semistructured Data Based on the Ambient Logic. Mathematical Structures in Computer Science, 14:285-327, 2004.
6. W. Charatonik. Automata on dag representations of nite trees. Technical report, 1999.
7. W. Charatonik and L. Pacholski. Set constraints with projections are in NEXPTIME. In IEEE Symposium on Foundations of Computer Science (FOCS), 1994.
8. H. Comon and V. Cortier. Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science (TCS), 331(1):143-214, 2005.
9. H. Comon, M. Dauchet, R. Gilleron, C. Loding, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007.
10. M. Dauchet, A.-C. Caron, and J.-L. Coquid́e. Reduction properties and automata with constraints. Journal of Symbolic Computation (JSC), 20:215-233, 1995.
11. E. Filiot. Logics for n-ary queries in trees. PhD thesis, Lille 1 University, 2008.
12. E. Filiot, J.-M. Talbot, and S. Tison. Satis ability of a spatial logic with tree variables. In Computer Science Logic (CSL), pages 130-145, 2007.
13. E. Filiot, J.-M. Talbot, and S. Tison. Tree automata with global constraints. In 12th International Conference on Developments in Language Theory (DLT), Lecture Notes in Computer Science. Springer Verlag, 2008.
14. R. Gilleron, S. Tison, and M. Tommasi. Some new decidability results on positive and negative set constraints. In Proceedings of the First International Conference on Constraints in Computational Logics (CCL), pages 336-351, 1994.
15. V. Halava, M. Hirvensalo, and R. de Wolf. Marked PCP is decidable. Theoretical Computer Science (TCS), 255(1-2):193-204, 2001.
16. 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'09), volume 5457, pages 446-457. Springer, 2009.
17. F. Jacquemard, M. Rusinowitch, and L. Vigneron. Tree automata with equality constraints modulo equational theories. Journal of Logic and Algebraic Programming 75(2): 182-208, 2008.
18. W. Karianto and C. Loding. Unranked tree automata with sibling equalities and disequalities. In International Colloquium on Automata Languages and Programming (ICALP), volume 4596, pages 875-887. Springer, 2007.
19. J. Mongy. Transformation de noyaux reconnaissables d'arbres. For̂ets RATEG. PhD thesis, Universit́e de Lille, 1981.
20. F. Neven and T. Schwentick. Xpath containment in the presence of disjunction, dtds, and variables. In International Conference on Database Theory (ICDT), pages 315-329, London, UK, 2002. Springer-Verlag.
21. T. Schwentick. Automata for xml -a survey. Journal Computer and System Science (JCSS), 73(3):289-315, 2007.
22. K. Stefansson. Systems of set constraints with negative constraints are nexptimecomplete. In IEEE Symposium on Logic in Computer Science (LICS), 1994.
23. J. W. Thatcher and J. B. Wright. Generalized nite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory (MST), 2(1):57-81, 1968.