| | |
- CSB - MetaPress - Google - Bing - Yahoo
Ask others: ACM DL/Guide - - CSB - MetaPress - Google - Bing - Yahoo
| 9 |       | Yves Andre, Francis Bossut, Anne-Cécile Caron: On decidability of boundedness property for regular path queries. Developments in Language Theory 1999: 245-256 |
| 8 |  | 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) |
| 7 | | Yves Andre, Francis Bossut: Word-into-Tree Transducers with Bounded Difference. TAPSOFT 1997: 177-188 |
| 6 | | Yves Andre, Francis Bossut: The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. TAPSOFT 1995: 155-171 |
| 4 | | Yves Andre, Francis Bossut: Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. FCT 1993: 142-151 |
Selection of 5 from 9 records - Francis Bossut has 4 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page