1. Equality and disequality constraints on direct subterms in tree automata;Bogaert,1992
2. On word rewriting systems having a rational derivation;Caucal,2001
3. Sequentiality, second order monadic logic and tree automata;Comon,1995
4. Comon, H., Dauchet, M., Gilleron, R., Lugiez, D., Tison, S., Tommasi, M., 1999. Tree Automata Techniques and Applications (TATA). http://www.grappa.univ-lille3.fr/tata
5. Bottom-up tree pushdown automata and rewrite systems;Coquidé,1991