1. The emptiness problem for tree automata with global constraints;Barguñó,2010
2. Decidable classes of tree automata mixing local and global constraints modulo flat theories;Barguñó;Log. Methods Comput. Sci.,2013
3. Equality and disequality constraints on direct subterms in tree automata;Bogaert,1992
4. Rewriting approximations for fast prototyping of static analyzers;Boichut,2007
5. Witold Charatonik, Automata on DAG representations of finite trees, Research report MPI-I-1999-2-001, Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, March 1999, Saarbrücken, Germany, p. 66123.