Bruno Guillon

Orcid: 0000-0003-1630-3404

According to our database1, Bruno Guillon authored at least 17 papers between 2014 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Weight-reducing Turing machines.
Inf. Comput., June, 2023

2022
Weakly and Strongly Irreversible Regular Languages.
Int. J. Found. Comput. Sci., 2022

Converting nondeterministic two-way automata into small deterministic linear-time machines.
Inf. Comput., 2022

2021
Reversible pushdown transducers.
Inf. Comput., 2021

2020
Undecidability of a weak version of MSO+U.
Log. Methods Comput. Sci., 2020

Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata.
Int. J. Found. Comput. Sci., 2020

2019
Linear-time limited automata.
Theor. Comput. Sci., 2019

2018
Undecidability of MSO+"ultimately periodic".
CoRR, 2018

On nondeterministic two-way transducers.
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.
Proceedings of the Developments in Language Theory - 22nd International Conference, 2018

Counter Machines and Distributed Automata - A Story About Exchanging Space and Time.
Proceedings of the Cellular Automata and Discrete Complex Systems, 2018

2017
Which Classes of Origin Graphs Are Generated by Transducers.
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.
RAIRO Theor. Informatics Appl., 2016

Both Ways Rational Functions.
Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015
Sweeping weakens two-way transducers even with a unary output alphabet.
Proceedings of the Seventh Workshop on Non-Classical Models of Automata and Applications - NCMA 2015, Porto, Portugal, August 31, 2015

2014
Two-way automata making choices only at the endmarkers.
Inf. Comput., 2014

An Algebraic Characterization of Unary Two-Way Transducers.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014


  Loading...