Francis Bossut

According to our database, Francis Bossut authored at least 9 papers between 1988 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

1999

On decidability of boundedness property for regular path queries.

Yves Andre, Francis Bossut, Anne-Cécile Caron

Proceedings of the Developments in Language Theory, 1999

1998

On the Equivalence Problem for Letter-to-Letter Top-Down Tree Transducers.

Yves Andre, Francis Bossut

Theor. Comput. Sci., 1998

1997

Word-into-Tree Transducers with Bounded Difference.

Yves Andre, Francis Bossut

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

1995

A Kleene Theorem for a Class of Planar Acyclic Graphs

Francis Bossut, Max Dauchet, Bruno Warin

Inf. Comput., March, 1995

The Equivalence Problem for Letter-to-Letter Bottom-up Tree Transducers is Solvable.

Yves Andre, Francis Bossut

Proceedings of the TAPSOFT'95: Theory and Practice of Software Development, 1995

1993

Decidability of Equivalence for Linear Letter to Letter To-down Tree Transducers.

Yves Andre, Francis Bossut

Proceedings of the Fundamentals of Computation Theory, 9th International Symposium, 1993

1992

Automata and Pattern Matching in Planar Directed Acyclic Graphs.

Francis Bossut, Bruno Warin

Proceedings of the LATIN '92, 1992

1991

On a code problem concerning planar acyclic graphs.

Francis Bossut, Bruno Warin

RAIRO Theor. Informatics Appl., 1991

1988

Automata and Rational Expressions on Planar Graphs.

Francis Bossut, Max Dauchet, Bruno Warin

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988