
Search the dblp DataBase
Francis Bossut:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Yves Andre, Francis Bossut, AnneCécile Caron
On decidability of boundedness property for regular path queries. [Citation Graph (0, 0)][DBLP] Developments in Language Theory, 1999, pp:245256 [Conf]
 Yves Andre, Francis Bossut
Decidability of Equivalence for Linear Letter to Letter Todown Tree Transducers. [Citation Graph (0, 0)][DBLP] FCT, 1993, pp:142151 [Conf]
 Francis Bossut, Bruno Warin
Automata and Pattern Matching in Planar Directed Acyclic Graphs. [Citation Graph (0, 0)][DBLP] LATIN, 1992, pp:7686 [Conf]
 Francis Bossut, Max Dauchet, Bruno Warin
Automata and Rational Expressions on Planar Graphs. [Citation Graph (0, 0)][DBLP] MFCS, 1988, pp:190200 [Conf]
 Yves Andre, Francis Bossut
The Equivalence Problem for LettertoLetter Bottomup Tree Transducers is Solvable. [Citation Graph (0, 0)][DBLP] TAPSOFT, 1995, pp:155171 [Conf]
 Yves Andre, Francis Bossut
WordintoTree Transducers with Bounded Difference. [Citation Graph (0, 0)][DBLP] TAPSOFT, 1997, pp:177188 [Conf]
 Francis Bossut, Max Dauchet, Bruno Warin
A Kleene Theorem for a Class of Planar Acyclic Graphs [Citation Graph (0, 0)][DBLP] Inf. Comput., 1995, v:117, n:2, pp:251265 [Journal]
 Francis Bossut, Bruno Warin
On a code problem concerning planar acyclic graphs. [Citation Graph (0, 0)][DBLP] ITA, 1991, v:25, n:, pp:205218 [Journal]
 Yves Andre, Francis Bossut
On the Equivalence Problem for LettertoLetter TopDown Tree Transducers. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1998, v:205, n:12, pp:207229 [Journal]
Search in 0.001secs, Finished in 0.002secs
