An algebraic characterization of unary two-way transducers. - Christian Choffrut; Bruno Guillon (ICTCS, 2014)

Two-way automata making choices only at the endmarkers. - Viliam Geffert; Bruno Guillon; Giovanni Pighizzini (Inf. Comput., 2014)

Sweeping weakens two-way transducers even with a unary output alphabet. - Bruno Guillon (NCMA, 2015)

Both Ways Rational Functions. - Christian Choffrut; Bruno Guillon (DLT, 2016)

Input- or output-unary sweeping transducers are weaker than their 2-way counterparts. - Bruno Guillon (RAIRO Theor. Informatics Appl., 2016)

Which Classes of Origin Graphs Are Generated by Transducers. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle (ICALP, 2017)

Counter Machines and Distributed Automata - A Story About Exchanging Space and Time. - Olivier Carton; Bruno Guillon; Fabian Reiter (Automata, 2018)

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (DLT, 2018)

On nondeterministic two-way transducers. - Bruno Guillon (NCMA, 2018)

Undecidability of MSO+"ultimately periodic". - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (CoRR, 2018)

Linear-time limited automata. - Bruno Guillon; Luca Prigioniero (Theor. Comput. Sci., 2019)

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2020)

Undecidability of a weak version of MSO+U. - Mikolaj Bojanczyk; Laure Daviaud; Bruno Guillon; Vincent Penelle; A. V. Sreejith (Log. Methods Comput. Sci., 2020)

Reversible pushdown transducers. - Bruno Guillon; Martin Kutrib; Andreas Malcher; Luca Prigioniero (Inf. Comput., 2021)

Converting nondeterministic two-way automata into small deterministic linear-time machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2022)

Weakly and Strongly Irreversible Regular Languages. - Bruno Guillon; Giovanna J. Lavado; Giovanni Pighizzini; Luca Prigioniero (Int. J. Found. Comput. Sci., 2022)

Weight-reducing Turing machines. - Bruno Guillon; Giovanni Pighizzini; Luca Prigioniero; Daniel Prusa (Inf. Comput., 2023)

Nondeterminism Makes Unary 1-Limited Automata Concise. - Bruno Guillon; Luca Prigioniero; Javad Taheri (DLT, 2025)

CMSO-Transducing Tree-Like Graph Decompositions. - Rutger Campbell; Bruno Guillon; Mamadou Moustapha Kanté; Eun Jung Kim 002; Noleen Köhler (STACS, 2025)

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata. - Bruno Guillon; Luca Prigioniero; Javad Taheri (CoRR, 2025)