 | 1995 |
|---|
| 8 |       | Max Dauchet,
Anne-Cécile Caron,
Jean-Luc Coquidé:
Automata for Reduction Properties Solving.
J. Symb. Comput. 20(2): 215-233 (1995) |
| 1994 |
|---|
| 7 | | Anne-Cécile Caron,
Hubert Comon,
Jean-Luc Coquidé,
Max Dauchet,
Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP 1994: 436-449 |
| 6 | | Anne-Cécile Caron,
Jean-Luc Coquidé:
Decidability of Reachability for Disjoint Union of Term Rewriting Systems.
Theor. Comput. Sci. 126(1): 31-52 (1994) |
| 5 | | Jean-Luc Coquidé,
Max Dauchet,
Rémi Gilleron,
Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata: Classification and Connection with Rewrite Systems.
Theor. Comput. Sci. 127(1): 69-98 (1994) |
| 1993 |
|---|
| 4 | | Anne-Cécile Caron,
Jean-Luc Coquidé,
Max Dauchet:
Encompassment Properties and Automata with Constraints.
RTA 1993: 328-342 |
| 1991 |
|---|
| 3 | | Jean-Luc Coquidé,
Max Dauchet,
Rémi Gilleron,
Sándor Vágvölgyi:
Bottom-Up Tree Pushdown Automata and Rewrite Systems.
RTA 1991: 287-298 |
| 1990 |
|---|
| 2 | | Jean-Luc Coquidé,
Rémi Gilleron:
Proofs and Reachablity Problem for Ground Rewrite Systems.
IMYCS 1990: 120-129 |
| 1989 |
|---|
| 1 |  | Jean-Luc Coquidé,
Max Dauchet,
Sophie Tison:
About Connections Between Syntactical and Computational Complexity.
FCT 1989: 105-115 |
Data released under the ODC-BY 1.0 license — See also our legal information page