default search action
Emanuele Rodaro
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c12]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
:
The Freeness Problem for Automaton Semigroups. MFCS 2024: 44:1-44:18 - [i22]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
The Freeness Problem for Automaton Semigroups. CoRR abs/2402.01372 (2024) - [i21]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
The Finiteness Problem for Automaton Semigroups of Extended Bounded Activity. CoRR abs/2406.20056 (2024) - [i20]Daniele D'Angeli, Francesco Matucci, Davide Perego, Emanuele Rodaro:
Context-free graphs and their transition groups. CoRR abs/2408.13070 (2024) - 2023
- [i19]Emanuele Rodaro:
A characterization of quasi-transitive tree-like inverse graphs. CoRR abs/2302.06664 (2023) - 2022
- [i18]Emanuele Rodaro, Jan Philipp Wächter:
The Self-Similarity of Free Semigroups and Groups. CoRR abs/2205.10248 (2022) - 2021
- [j17]Achille Frigeri, Victoria Gould, Patrizia Longobardi, Emanuele Rodaro:
Preface: Special issue on papers from the conference "Semigroups and Groups, Automata, Logics" SandGAL 2019. Int. J. Algebra Comput. 31(6): 983-984 (2021) - [j16]Christoph Aistleitner, Daniele D'Angeli, Abraham Gutierrez, Emanuele Rodaro, Amnon Rosenmann
Circular automata synchronize with high probability. J. Comb. Theory A 178: 105356 (2021) - 2020
- [j15]Daniele D'Angeli
Boundary dynamics for bireversible and for contracting automaton groups. Int. J. Algebra Comput. 30(02): 431-449 (2020) - [j14]Daniele D'Angeli
Orbit expandability of automaton semigroups and groups. Theor. Comput. Sci. 809: 418-429 (2020) - [i17]Daniele D'Angeli, Dominik Francoeur, Emanuele Rodaro, Jan Philipp Wächter
On the Orbits of Automaton Semigroups and Groups. CoRR abs/2007.10273 (2020)
2010 – 2019
- 2019
- [j13]Achille Frigeri, Emanuele Rodaro:
Missing Factors of Ideals and Synchronizing Automata. J. Autom. Lang. Comb. 24(2-4): 309-320 (2019) - [i16]Daniele D'Angeli, Dominik Francoeur, Emanuele Rodaro, Jan Philipp Wächter:
Orbits of Automaton Semigroups and Groups. CoRR abs/1903.00222 (2019) - 2018
- [j12]Emanuele Rodaro
Strongly connected synchronizing automata and the language of minimal reset words. Adv. Appl. Math. 99: 158-173 (2018) - [j11]Marina I. Maslennikova, Emanuele Rodaro:
Trim Strongly Connected Synchronizing Automata and Ideal Languages. Fundam. Informaticae 162(2-3): 183-203 (2018) - [i15]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
On the Structure Theory of Partial Automaton Semigroups. CoRR abs/1811.09420 (2018) - [i14]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
Orbit Expandability of Automaton Semigroups and Groups. CoRR abs/1812.07359 (2018) - 2017
- [j10]Daniele D'Angeli
On the complexity of the word problem for automaton semigroups and automaton groups. Adv. Appl. Math. 90: 160-187 (2017) - [i13]Emanuele Rodaro:
Synchronizing automata and the language of minimal reset words. CoRR abs/1708.04864 (2017) - [i12]Emanuele Rodaro:
A bound for the shortest reset words for semisimple synchronizing automata via the packing number. CoRR abs/1711.00651 (2017) - [i11]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter
Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness. CoRR abs/1712.07408 (2017) - 2016
- [j9]Jorge Almeida, Emanuele Rodaro:
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. Int. J. Found. Comput. Sci. 27(2): 127-146 (2016) - [j8]Rogério Reis
Ideal regular languages and strongly connected synchronizing automata. Theor. Comput. Sci. 653: 97-107 (2016) - [i10]Daniele D'Angeli, Thibault Godin, Ines Klimann, Matthieu Picantin, Emanuele Rodaro:
Boundary action of automaton groups without singular points and Wang tilings. CoRR abs/1604.07736 (2016) - [i9]Daniele D'Angeli, Emanuele Rodaro, Jan Philipp Wächter:
On the Complexity of the Word Problem of Automaton Semigroups and Automaton Groups. CoRR abs/1611.09541 (2016) - 2015
- [c11]Marina I. Maslennikova, Emanuele Rodaro:
Representation of (Left) Ideal Regular Languages by Synchronizing Automata. CSR 2015: 325-338 - [c10]Emanuele Rodaro:
New reformulations of Cerny's conjecture and related problems. NCMA 2015: 49-58 - [i8]I. Bondarenko, Daniele D'Angeli, Emanuele Rodaro:
The lamplighter group ℤ3 wr ℤ generated by a bireversible automaton. CoRR abs/1502.07981 (2015) - 2014
- [j7]Daniele D'Angeli
Groups and semigroups defined by colorings of synchronizing automata. Int. J. Algebra Comput. 24(6): 773-794 (2014) - [c9]Jorge Almeida, Emanuele Rodaro:
Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. Developments in Language Theory 2014: 49-60 - [i7]Daniele D'Angeli, Emanuele Rodaro:
A geometric approach to (semi)-groups defined by automata via dual transducers. CoRR abs/1403.1722 (2014) - [i6]Daniele D'Angeli, Emanuele Rodaro:
On the freeness of automata groups. CoRR abs/1410.6097 (2014) - [i5]Marina I. Maslennikova, Emanuele Rodaro:
Representation of (Left) Ideal Regular Languages by Synchronizing Automata. CoRR abs/1412.6767 (2014) - 2013
- [j6]Emanuele Rodaro
On periodic Points of Free inverse Monoid Homomorphisms. Int. J. Algebra Comput. 23(8): 1789-1804 (2013) - [c8]Rogério Reis
Regular Ideal Languages and Synchronizing Automata. WORDS 2013: 205-216 - [i4]Emanuele Rodaro, Öznur Yeldan:
A multi-lane traffic simulation model via continuous cellular automata. CoRR abs/1302.0488 (2013) - [i3]Daniele D'Angeli, Emanuele Rodaro:
Groups and Semigroups Defined by Colorings of Synchronizing Automata. CoRR abs/1310.5242 (2013) - 2012
- [i2]Pedro V. Silva, Emanuele Rodaro:
Fixed points of endomorphisms of trace monoids. CoRR abs/1211.4517 (2012) - [i1]Emanuele Rodaro, Pedro V. Silva:
On periodic points of free inverse monoid endomorphisms. CoRR abs/1212.4284 (2012) - 2011
- [j5]Elena V. Pribavkina, Emanuele Rodaro
Synchronizing automata with finitely many minimal synchronizing words. Inf. Comput. 209(3): 568-579 (2011) - [j4]Alessandra Cherubini, C. Nuccio, Emanuele Rodaro
Multilinear Equations in Amalgams of Finite Inverse Semigroups. Int. J. Algebra Comput. 21(1-2): 35-59 (2011) - [j3]Elena V. Pribavkina, Emanuele Rodaro
State Complexity of Code Operators. Int. J. Found. Comput. Sci. 22(7): 1669-1681 (2011) - [c7]Elena V. Pribavkina, Emanuele Rodaro
Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. CiE 2011: 230-238 - [c6]Emanuele Rodaro
Never Minimal Automata and the Rainbow Bipartite Subgraph Problem. Developments in Language Theory 2011: 374-385 - 2010
- [j2]Emanuele Rodaro
Bicyclic Subsemigroups in Amalgams of Finite Inverse Semigroups. Int. J. Algebra Comput. 20(1): 89-113 (2010) - [c5]Elena V. Pribavkina, Emanuele Rodaro
State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages. Developments in Language Theory 2010: 376-386
2000 – 2009
- 2009
- [j1]Luca Breveglieri, Alessandra Cherubini, C. Nuccio, Emanuele Rodaro:
Alphabetical Satisfiability Problem for Trace Equations. Acta Cybern. 19(2): 479-497 (2009) - [c4]Elena V. Pribavkina, Emanuele Rodaro:
State Complexity For Prefix, Suffix and Bifix operators on regular languages. ICTCS 2009: 183-189 - [c3]Elena V. Pribavkina, Emanuele Rodaro
Finitely Generated Synchronizing Automata. LATA 2009: 672-683 - 2008
- [c2]Luca Breveglieri, Alessandra Cherubini, Claudia Di Nucci, Emanuele Rodaro:
NP-completeness of the alphabetical satisfiability problem for trace equations. AFL 2008: 111-121 - [c1]C. Nuccio, Emanuele Rodaro:
Mortality Problem for 2×2 Integer Matrices. SOFSEM 2008: 400-405
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-10-07 22:15 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: