- CSB - MetaPress - Google - Bing - Yahoo
 | 1999 | |
|---|---|---|
| c6 |      | 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 | ||
| j3 |  | 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 | ||
| c5 | | Yves Andre, Francis Bossut: Word-into-Tree Transducers with Bounded Difference. TAPSOFT 1997: 177-188 |
| 1995 | ||
| j2 | | Francis Bossut, Max Dauchet, Bruno Warin: A Kleene Theorem for a Class of Planar Acyclic Graphs. Inf. Comput. 117(2): 251-265 (1995) |
| c4 | | Yves Andre, Francis Bossut: The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. TAPSOFT 1995: 155-171 |
| 1993 | ||
| c3 | | Yves Andre, Francis Bossut: Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. FCT 1993: 142-151 |
| 1992 | ||
| c2 | | Francis Bossut, Bruno Warin: Automata and Pattern Matching in Planar Directed Acyclic Graphs. LATIN 1992: 76-86 |
| 1991 | ||
| j1 | | Francis Bossut, Bruno Warin: On a code problem concerning planar acyclic graphs. ITA 25: 205-218 (1991) |
| 1988 | ||
| c1 | | Francis Bossut, Max Dauchet, Bruno Warin: Automata and Rational Expressions on Planar Graphs. MFCS 1988: 190-200 |
| 1 | Yves Andre | |
| 2 | Anne-Cécile Caron | |
| 3 | Max Dauchet | |
| 4 | Bruno Warin |
Data released under the ODC-BY 1.0 license — See also our legal information page