Automata and Rational Expressions on Planar Graphs. - Francis Bossut; Max Dauchet; Bruno Warin (MFCS, 1988)

On a code problem concerning planar acyclic graphs. - Francis Bossut; Bruno Warin (RAIRO Theor. Informatics Appl., 1991)

Automata and Pattern Matching in Planar Directed Acyclic Graphs. - Francis Bossut; Bruno Warin (LATIN, 1992)

Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers. - Yves Andre; Francis Bossut (FCT, 1993)

The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable. - Yves Andre; Francis Bossut (TAPSOFT, 1995)

A Kleene Theorem for a Class of Planar Acyclic Graphs - Francis Bossut; Max Dauchet; Bruno Warin (Inf. Comput., 1995)

Word-into-Tree Transducers with Bounded Difference. - Yves Andre; Francis Bossut (TAPSOFT, 1997)

On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers. - Yves Andre; Francis Bossut (Theor. Comput. Sci., 1998)

On decidability of boundedness property for regular path queries. - Yves Andre; Francis Bossut; Anne-Cécile Caron (Developments in Language Theory, 1999)