default search action
Bruno Guillon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j9]Bruno Guillon
, Giovanni Pighizzini
Weight-reducing Turing machines. Inf. Comput. 292: 105030 (2023) - 2022
- [j8]Bruno Guillon
Converting nondeterministic two-way automata into small deterministic linear-time machines. Inf. Comput. 289(Part): 104938 (2022) - [j7]Bruno Guillon, Giovanna J. Lavado, Giovanni Pighizzini, Luca Prigioniero
Weakly and Strongly Irreversible Regular Languages. Int. J. Found. Comput. Sci. 33(3&4): 263-284 (2022) - 2021
- [j6]Bruno Guillon, Martin Kutrib
Reversible pushdown transducers. Inf. Comput. 281: 104813 (2021) - [i5]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Converting Nondeterministic Two-Way Automata into Small Deterministic Linear-Time Machines. CoRR abs/2103.05485 (2021) - [i4]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero, Daniel Prusa:
Weight-Reducing Turing Machines. CoRR abs/2103.05486 (2021) - 2020
- [j5]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. Int. J. Found. Comput. Sci. 31(8): 1133-1157 (2020) - [j4]Mikolaj Bojanczyk, Laure Daviaud
Undecidability of a weak version of MSO+U. Log. Methods Comput. Sci. 16(1) (2020)
2010 – 2019
- 2019
- [j3]Bruno Guillon, Luca Prigioniero
Linear-time limited automata. Theor. Comput. Sci. 798: 95-108 (2019) - 2018
- [c12]Olivier Carton
Counter Machines and Distributed Automata - A Story About Exchanging Space and Time. Automata 2018: 13-28 - [c11]Bruno Guillon
Linear-Time Limited Automata. DCFS 2018: 126-138 - [c10]Bruno Guillon, Martin Kutrib
Reversible Pushdown Transducers. DLT 2018: 354-365 - [c9]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
Two-Way Automata and One-Tape Machines - Read Only Versus Linear Time. DLT 2018: 366-378 - [c8]Bruno Guillon:
On nondeterministic two-way transducers. NCMA 2018: 11-27 - [c7]Bruno Guillon, Giovanni Pighizzini, Luca Prigioniero
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata. CIAA 2018: 186-197 - [i3]Olivier Carton, Bruno Guillon
Counter Machines and Distributed Automata: A Story about Exchanging Space and Time. CoRR abs/1804.03582 (2018) - [i2]Mikolaj Bojanczyk, Laure Daviaud, Bruno Guillon, Vincent Penelle, A. V. Sreejith:
Undecidability of MSO+"ultimately periodic". CoRR abs/1807.08506 (2018) - 2017
- [c6]Mikolaj Bojanczyk, Laure Daviaud
Which Classes of Origin Graphs Are Generated by Transducers. ICALP 2017: 114:1-114:13 - 2016
- [j2]Bruno Guillon
Input- or output-unary sweeping transducers are weaker than their 2-way counterparts. RAIRO Theor. Informatics Appl. 50(4): 275-294 (2016) - [c5]Christian Choffrut, Bruno Guillon
Both Ways Rational Functions. DLT 2016: 114-124 - 2015
- [c4]Bruno Guillon:
Sweeping weakens two-way transducers even with a unary output alphabet. NCMA 2015: 91-108 - 2014
- [j1]Viliam Geffert, Bruno Guillon
Two-way automata making choices only at the endmarkers. Inf. Comput. 239: 71-86 (2014) - [c3]Christian Choffrut, Bruno Guillon:
An algebraic characterization of unary two-way transducers. ICTCS 2014: 279-283 - [c2]Christian Choffrut, Bruno Guillon
An Algebraic Characterization of Unary Two-Way Transducers. MFCS (1) 2014: 196-207 - 2012
- [c1]Viliam Geffert, Bruno Guillon
Two-Way Automata Making Choices Only at the Endmarkers. LATA 2012: 264-276 - 2011
- [i1]Viliam Geffert, Bruno Guillon
Two-Way Automata Making Choices Only at the Endmarkers. CoRR abs/1110.1263 (2011)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: