| 2007 |
|---|
| 9 | EE | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos,
Sophie Tison:
Path constraints in semistructured data.
Theor. Comput. Sci. 385(1-3): 11-33 (2007) |
| 2005 |
|---|
| 8 | EE | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos:
Indexes and Path Constraints in Semistructured Data.
DEXA Workshops 2005: 837-841 |
| 2004 |
|---|
| 7 | EE | Yves Andre,
Anne-Cécile Caron,
Denis Debarbieux,
Yves Roos,
Sophie Tison:
Extraction and Implication of Path Constraints.
MFCS 2004: 863-875 |
| 1999 |
|---|
| 6 | | Yves Andre,
Francis Bossut,
Anne-Cécile Caron:
On decidability of boundedness property for regular path queries.
Developments in Language Theory 1999: 245-256 |
| 1998 |
|---|
| 5 | EE | Yves Andre,
Francis Bossut:
On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers.
Theor. Comput. Sci. 205(1-2): 207-229 (1998) |
| 1997 |
|---|
| 4 | | Yves Andre,
Francis Bossut:
Word-into-Tree Transducers with Bounded Difference.
TAPSOFT 1997: 177-188 |
| 1995 |
|---|
| 3 | | Yves Andre,
Francis Bossut:
The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable.
TAPSOFT 1995: 155-171 |
| 1994 |
|---|
| 2 | | Yves Andre,
Max Dauchet:
Decidability of Equivalence for a Class of Non-Deterministic Tree Transducers.
ITA 28(5): 447-463 (1994) |
| 1993 |
|---|
| 1 | | Yves Andre,
Francis Bossut:
Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers.
FCT 1993: 142-151 |
