Bruno Guillon

According to our database, Bruno Guillon authored at least 21 papers between 2012 and 2025.

Collaborative distances:

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

2025

Polynomial Complementation of Nondeterministic 2-Way Finite Automata by 1-Limited Automata.

Bruno Guillon, Luca Prigioniero, Javad Taheri

CoRR, July, 2025

CMSO-Transducing Tree-Like Graph Decompositions.

Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Noleen Köhler

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Recognisability Equals Definability for Finitely Representable Matroids of Bounded Path-Width.

Rutger Campbell, Bruno Guillon, Mamadou Moustapha Kanté, Eun Jung Kim, Sang-il Oum

Proceedings of the 40th Annual ACM/IEEE Symposium on Logic in Computer Science, 2025

Nondeterminism Makes Unary 1-Limited Automata Concise.

Bruno Guillon, Luca Prigioniero, Javad Taheri

Proceedings of the Developments in Language Theory - 29th International Conference, 2025

2023

Weight-reducing Turing machines.

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa

Inf. Comput., June, 2023

2022

Weakly and Strongly Irreversible Regular Languages.

Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero

Int. J. Found. Comput. Sci., 2022

Converting nondeterministic two-way automata into small deterministic linear-time machines.

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa

Inf. Comput., 2022

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

2018

Undecidability of MSO+"ultimately periodic".

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith

CoRR, 2018

Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero

Proceedings of the Implementation and Application of Automata, 2018

On nondeterministic two-way transducers.

Bruno Guillon

Proceedings of the Tenth Workshop on Non-Classical Models of Automata and Applications, 2018

Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time.

Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Reversible Pushdown Transducers.

Bruno Guillon, Martin Kutrib, Andreas Malcher, Luca Prigioniero

Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Linear-Time Limited Automata.

Bruno Guillon, Luca Prigioniero

Proceedings of the Descriptional Complexity of Formal Systems, 2018

Counter Machines and Distributed Automata - A Story About Exchanging Space and Time.

Olivier Carton, Bruno Guillon, Fabian Reiter

Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017

Which Classes of Origin Graphs Are Generated by Transducers.

Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Input- or output-unary sweeping transducers are weaker than their 2-way counterparts.

Bruno Guillon

RAIRO Theor. Informatics Appl., 2016

Both Ways Rational Functions.

Christian Choffrut, Bruno Guillon

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Sweeping weakens two-way transducers even with a unary output alphabet.

Bruno Guillon

Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

2014

An Algebraic Characterization of Unary Two-Way Transducers.

Christian Choffrut, Bruno Guillon

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2012

Two-Way Automata Making Choices Only at the Endmarkers.

Viliam Geffert, Bruno Guillon, Giovanni Pighizzini

Proceedings of the Language and Automata Theory and Applications, 2012