1. J. Chabin, J. Chen, and P. Réty. Synchronized-context free tree-tuple languages. Technical Report RR-2006-13, LIFO, 4 rue Léonard de Vinci, BP 6759, F-45067 Orléans Cedex 2 FRANCE, 2006.
2. H. Chen and J. Hsiang. Logic programming with recurrence domains. In Automata, Languages and Programming (ICALP’91), pages 20–34. Springer, LNCS 510, 1991.
3. H. Comon. On unification of terms with integer exponents. Mathitatical Systit Theory, 28:67–88, 1995.
4. H. Comon, M. Dauchet, R. Gilleron, F. Jacquitard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
5. H. Comon and C. Delor. Equational formulae with mitbership constraints. Information and Computation, 112(2):167–216, August 1994.