About Connections Between Syntactical and Computational Complexity. - Jean-Luc Coquidé; Max Dauchet; Sophie Tison (FCT, 1989)

Proofs and Reachablity Problem for Ground Rewrite Systems. - Jean-Luc Coquidé; Rémi Gilleron (IMYCS, 1990)

Bottom-Up Tree Pushdown Automata and Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (RTA, 1991)

Encompassment Properties and Automata with Constraints. - Anne-Cécile Caron; Jean-Luc Coquidé; Max Dauchet (RTA, 1993)

Pumping, Cleaning and Symbolic Constraints Solving. - Anne-Cécile Caron; Hubert Comon; Jean-Luc Coquidé; Max Dauchet; Florent Jacquemard (ICALP, 1994)

Decidability of Reachability for Disjoint Union of Term Rewriting Systems. - Anne-Cécile Caron; Jean-Luc Coquidé (Theor. Comput. Sci., 1994)

Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems. - Jean-Luc Coquidé; Max Dauchet; Rémi Gilleron; Sándor Vágvölgyi (Theor. Comput. Sci., 1994)

Automata for Reduction Properties Solving. - Max Dauchet; Anne-Cécile Caron; Jean-Luc Coquidé (J. Symb. Comput., 1995)