Tree automata with global constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5257 LNCS, Issue , 2008, Pages 314-326

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

^a UNIV LILLE   (France)

^b AIX MARSEILLE UNIVERSITY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EQUALITY RELATIONS; GLOBAL CONSTRAINTS; ISOMORPHISM TESTS; SECOND ORDERS; TREE AUTOMATON; TWO STATES;

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTABILITY AND DECIDABILITY; FORMAL LOGIC; LINGUISTICS; RECURSIVE FUNCTIONS; ROBOTS; SET THEORY; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 54249158025     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-85780-8_25     Document Type: Conference Paper

References (23)

1. Aiken, A., Kozen, D., Wimmers, E.L.: Decidability of systems of set constraints with negative constraints. Information and Computation 122(1), 30-44 (1995)
2. Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231-240 (2005)
3. 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)
4. Charatonik, W.: Automata on dag representations of finite trees. Technical report (1999)
5. Charatonik, W., Pacholski, L.: Set constraints with projections are in NEXPTIME. In: IEEE Symposium on Foundations of Computer Science (1994)
6. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. TCS 331(1), 143-214 (2005)
7. 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
8. Comon, H., Delor, C.: Equational formulae with membership constraints. Information and Computation 112(2), 167-216 (1994)
9. Dauchet, M., Caron, A.-C., Coquidé, J.-L.: Reduction properties and automata with constraints. JSC 20, 215-233 (1995)
10. 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)
11. 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)
12. Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Research Report, LSV, ENS Cachan (2006)
13. Karianto, W., Löding, C.: Unranked tree automata with sibling equalities and disequalities. Research Report, RWTH Aachen (2006)
14. Kirchner, C., Kopetz, R., Moreau, P.-E.: Anti-pattern matching. In: De Nicola, R. (ed.) ESOP 2007. LNCS, vol. 4421. Springer, Heidelberg (2007)
15. Kutsia, T., Marin, M.: Solving regular constraints for hedges and contexts. In: UNIF 2006, pp. 89-107 (2006)
16. Libkin, L.: Logics over unranked trees: an overview. LMCS 2006 3(2), 1-31 (2006)
17. Mongy, J.: Transformation de noyaux reconnaissables d'arbres. Forêts RATEG. PhD thesis, Université de Lille (1981)
18. Murata, M.: Hedge automata: A formal model for xml schemata. Technical report, Fuji Xerox Information Systems (1999)
19. 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)
20. Schwentick, T.: Automata for XML - a survey. J. Comput. Syst. Sci. 73(3), 289-315 (2007)
21. Stefansson, K.: Systems of set constraints with negative constraints are nexptime-complete. In: LICS (1994)
22. 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)
23. Full paper version, http://hal.inria.fr/inria-00292027