Rigid tree automata

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

Volumn 5457, Issue , 2009, Pages 446-457

  Jacquemard, Florent ^a   Klay, Francis ^b   Vacher, Camille ^c  

^a INRIA SACLAY   (France)

^b FT/RD/MAPS/AMS/SLE ^*

^c CNRS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; EMPTINESS PROBLEM; FINITE TREE AUTOMATON; LINEAR TIME; NON-LINEAR; NP COMPLETE; PUMPING LEMMA; RIGID STATE; SUBTREES; TERM REWRITING SYSTEMS; TREE AUTOMATA; TREE-PATTERN MATCHING;

COMPUTABILITY AND DECIDABILITY; LINGUISTICS; MODEL CHECKING; PATTERN MATCHING; QUERY LANGUAGES; ROBOTS; TESTING; TRANSLATION (LANGUAGES);

AUTOMATA THEORY;

EID: 67649964811     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00982-2_38     Document Type: Conference Paper

References (17)

1. 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)
2. Dauchet, M., Caron, A.C., Coquidé, J.L.: Automata for Reduction Properties Solving. Journal of Symbolic Computation 20(2), 215-233 (1995)
3. Comon, H., Cortier, V.: Tree automata with one memory, set constraints and cryptographic protocols. Theoretical Computer Science 331(1), 143-214 (2005) (Pubitemid 40415266)
4. Filiot, E., Talbot, J.M., Tison, S.: Tree automata with global constraints. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, Vol. 5257, pp. 314-326. Springer, Heidelberg (2008)
5. Bouajjani, A., Touili, T.: On computing reachability sets of process rewrite systems. In: Giesl, J. (ed.) RTA 2005. LNCS, Vol. 3467, pp. 484-499. Springer, Heidelberg (2005) (Pubitemid 41313377)
6. Genet, T., Klay, F.: Rewriting for Cryptographic Protocol Verification. In: McAllester, D. (ed.) CADE 2000. LNCS, Vol. 1831. Springer, Heidelberg (2000)
7. Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: 28th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL, pp. 104-115(2001) (Pubitemid 33720332)
8. Jacquemard, F., Rusinowitch, M., Vigneron, L.: Tree automata with equality constraints modulo equational theories. Journal of Logic and Algebraic Programming 75(2), 182-208 (2008)
9. Jacquemard, F., Klay, F., Vacher, C.: Rigid tree automata. Technical Report RRLSV-0827, Laboratoire Spécification et Vérification (2008)
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. Charatonik, W.: Automata on dag representations of finite trees. Technical Report Technical Report MPI-I-99-2-001, Max-Planck-Institut für Informatik, Saarbrücken, Germany (1999)
12. Anantharaman, S., Narendran, P., Rusinowitch, M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231-240 (2005)
13. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Löding, C., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications (2007), http://tata.gforge.inria.fr
14. Seidl, H.: Haskell overloading is DEXPTIME-complete. Information Processing Letters 52(2), 57-60 (1994) (Pubitemid 124013221)
15. Alur, R., Madhusudan, P.: Visibly pushdown languages. In: 36th Annual ACM Symposium on Theory of Computing, STOC, pp. 202-211. ACM, New York (2004)
16. Chabin, J., Réty, P.: Visibly pushdown languages and term rewriting. In: Konev, B., Wolter, F. (eds.) FroCos 2007. LNCS, Vol. 4720, pp. 252-266. Springer, Heidelberg (2007)
17. Comon-Lundh, H., Jacquemard, F., Perrin, N.: Tree automata with memory, visibility and structural constraints. In: Seidl, H. (ed.) FOSSACS 2007. LNCS, Vol. 4423, pp. 168-182. Springer, Heidelberg (2007) (Pubitemid 350259702)