NP-completeness of the alphabetical satisfiability problem for trace equations. - Luca Breveglieri; Alessandra Cherubini; Claudia Di Nucci; Emanuele Rodaro (AFL, 2008)

Mortality Problem for 2×2 Integer Matrices. - C. Nuccio; Emanuele Rodaro (SOFSEM, 2008)

State Complexity For Prefix, Suffix and Bifix operators on regular languages. - Elena V. Pribavkina; Emanuele Rodaro (ICTCS, 2009)

Finitely Generated Synchronizing Automata. - Elena V. Pribavkina; Emanuele Rodaro (LATA, 2009)

Alphabetical Satisfiability Problem for Trace Equations. - Luca Breveglieri; Alessandra Cherubini; C. Nuccio; Emanuele Rodaro (Acta Cybern., 2009)

State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages. - Elena V. Pribavkina; Emanuele Rodaro (Developments in Language Theory, 2010)

Bicyclic Subsemigroups in Amalgams of Finite Inverse Semigroups. - Emanuele Rodaro (Int. J. Algebra Comput., 2010)

Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete. - Elena V. Pribavkina; Emanuele Rodaro (CiE, 2011)

Never Minimal Automata and the Rainbow Bipartite Subgraph Problem. - Emanuele Rodaro; Pedro V. Silva (Developments in Language Theory, 2011)

Synchronizing automata with finitely many minimal synchronizing words. - Elena V. Pribavkina; Emanuele Rodaro (Inf. Comput., 2011)

Multilinear Equations in Amalgams of Finite Inverse Semigroups. - Alessandra Cherubini; C. Nuccio; Emanuele Rodaro (Int. J. Algebra Comput., 2011)

State Complexity of Code Operators. - Elena V. Pribavkina; Emanuele Rodaro (Int. J. Found. Comput. Sci., 2011)

Fixed points of endomorphisms of trace monoids - Pedro V. Silva; Emanuele Rodaro (CoRR, 2012)

On periodic points of free inverse monoid endomorphisms - Emanuele Rodaro; Pedro V. Silva (CoRR, 2012)

Regular Ideal Languages and Synchronizing Automata. - Rogério Reis; Emanuele Rodaro (WORDS, 2013)

A multi-lane traffic simulation model via continuous cellular automata - Emanuele Rodaro; Öznur Yeldan (CoRR, 2013)

On periodic Points of Free inverse Monoid Homomorphisms. - Emanuele Rodaro; Pedro V. Silva (Int. J. Algebra Comput., 2013)

A geometric approach to (semi)-groups defined by automata via dual transducers. - Daniele D'Angeli; Emanuele Rodaro (CoRR, 2014)

On the freeness of automata groups. - Daniele D'Angeli; Emanuele Rodaro (CoRR, 2014)

Groups and semigroups defined by colorings of synchronizing automata. - Daniele D'Angeli; Emanuele Rodaro (Int. J. Algebra Comput., 2014)

Representation of (Left) Ideal Regular Languages by Synchronizing Automata. - Marina I. Maslennikova; Emanuele Rodaro (CSR, 2015)

New reformulations of Cerny's conjecture and related problems. - Emanuele Rodaro (NCMA, 2015)

The lamplighter group ℤ3 wr ℤ generated by a bireversible automaton. - I. Bondarenko; Daniele D'Angeli; Emanuele Rodaro (CoRR, 2015)

Boundary action of automaton groups without singular points and Wang tilings. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (CoRR, 2016)

Semisimple Synchronizing Automata and the Wedderburn-Artin Theory. - Jorge Almeida 001; Emanuele Rodaro (Int. J. Found. Comput. Sci., 2016)

Ideal regular languages and strongly connected synchronizing automata. - Rogério Reis; Emanuele Rodaro (Theor. Comput. Sci., 2016)

On the complexity of the word problem for automaton semigroups and automaton groups. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (Adv. Appl. Math., 2017)

Synchronizing automata and the language of minimal reset words. - Emanuele Rodaro (CoRR, 2017)

A bound for the shortest reset words for semisimple synchronizing automata via the packing number. - Emanuele Rodaro (CoRR, 2017)

Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (CoRR, 2017)

Strongly connected synchronizing automata and the language of minimal reset words. - Emanuele Rodaro (Adv. Appl. Math., 2018)

On the Structure Theory of Partial Automaton Semigroups. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (CoRR, 2018)

Trim Strongly Connected Synchronizing Automata and Ideal Languages. - Marina I. Maslennikova; Emanuele Rodaro (Fundam. Informaticae, 2018)

Orbits of Automaton Semigroups and Groups. - Daniele D'Angeli; Dominik Francoeur; Emanuele Rodaro; Jan Philipp Wächter (CoRR, 2019)

Missing Factors of Ideals and Synchronizing Automata. - Achille Frigeri; Emanuele Rodaro (J. Autom. Lang. Comb., 2019)

Boundary dynamics for bireversible and for contracting automaton groups. - Daniele D'Angeli; Thibault Godin; Ines Klimann; Matthieu Picantin; Emanuele Rodaro (Int. J. Algebra Comput., 2020)

Orbit expandability of automaton semigroups and groups. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (Theor. Comput. Sci., 2020)

Preface: Special issue on papers from the conference "Semigroups and Groups, Automata, Logics" SandGAL 2019. - Achille Frigeri; Victoria Gould; Patrizia Longobardi; Emanuele Rodaro (Int. J. Algebra Comput., 2021)

Circular automata synchronize with high probability. - Christoph Aistleitner; Daniele D'Angeli; Abraham Gutierrez; Emanuele Rodaro; Amnon Rosenmann (J. Comb. Theory A, 2021)

The Self-Similarity of Free Semigroups and Groups. - Emanuele Rodaro; Jan Philipp Wächter (CoRR, 2022)

A characterization of quasi-transitive tree-like inverse graphs. - Emanuele Rodaro (CoRR, 2023)

The Freeness Problem for Automaton Semigroups. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (MFCS, 2024)

The Finiteness Problem for Automaton Semigroups of Extended Bounded Activity. - Daniele D'Angeli; Emanuele Rodaro; Jan Philipp Wächter (CoRR, 2024)

Context-free graphs and their transition groups. - Daniele D'Angeli; Francesco Matucci; Davide Perego; Emanuele Rodaro (CoRR, 2024)

On the subgroup membership problem in bounded automata groups. - Alex Bishop; Daniele D'Angeli; Francesco Matucci; Tatiana Nagnibeda; Davide Perego; Emanuele Rodaro (CoRR, 2024)

Applications of automaton groups in cryptography. - Delaram Kahrobaei; Marialaura Noce; Emanuele Rodaro (Int. J. Comput. Math. Comput. Syst. Theory, 2024)