| 2026 | STACS | Polynomial Complementation of Nondeterministic Two-Way Finite Automata by 1-Limited Automata. | Bruno Guillon, Luca Prigioniero, Javad Taheri |
| 2025 | DLT | Nondeterminism Makes Unary 1-Limited Automata Concise. | Bruno Guillon, Luca Prigioniero, Javad Taheri |
| 2025 | LICS | Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Sang-il Oum |
| 2025 | STACS | CMSO-Transducing Tree-Like Graph Decompositions. | Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kant, Eun Jung Kim, Noleen Khler |
| 2018 | DLT | Reversible Pushdown Transducers. | Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero |
| 2018 | DLT | Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. | Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa |
| 2017 | ICALP | Which Classes of Origin Graphs Are Generated by Transducers. | Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle |
| 2016 | DLT | Both Ways Rational Functions. | Christian Choffrut, Bruno Guillon |
| 2014 | MFCS | An Algebraic Characterization of Unary Two-Way Transducers. | Christian Choffrut, Bruno Guillon |
| 2012 | LATA | Two-Way Automata Making Choices Only at the Endmarkers. | Viliam Geffert, Bruno Guillon, Giovanni Pighizzini |