Emanuele Rodaro

CoRR, 2024

The Freeness Problem for Automaton Semigroups.

[BibT_eX]

[DOI]

Proceedings of the 49th International Symposium on Mathematical Foundations of Computer Science, 2024

2023

A characterization of quasi-transitive tree-like inverse graphs.

[BibT_eX]

[DOI]

CoRR, 2023

2022

The Self-Similarity of Free Semigroups and Groups.

[BibT_eX]

[DOI]

CoRR, 2022

2021

Circular automata synchronize with high probability.

[BibT_eX]

[DOI]

Christoph Aistleitner

J. Comb. Theory A, 2021

Preface: Special issue on papers from the conference "Semigroups and Groups, Automata, Logics" SandGAL 2019.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2021

2020

Orbit expandability of automaton semigroups and groups.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Boundary dynamics for bireversible and for contracting automaton groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2020

2019

Missing Factors of Ideals and Synchronizing Automata.

[BibT_eX]

[DOI]

Achille Frigeri

J. Autom. Lang. Comb., 2019

Orbits of Automaton Semigroups and Groups.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Trim Strongly Connected Synchronizing Automata and Ideal Languages.

[BibT_eX]

[DOI]

Marina I. Maslennikova

Fundam. Informaticae, 2018

On the Structure Theory of Partial Automaton Semigroups.

[BibT_eX]

[DOI]

CoRR, 2018

Strongly connected synchronizing automata and the language of minimal reset words.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2018

2017

Automaton Semigroups and Groups: on the Undecidability of Problems Related to Freeness and Finiteness.

[BibT_eX]

[DOI]

CoRR, 2017

A bound for the shortest reset words for semisimple synchronizing automata via the packing number.

[BibT_eX]

[DOI]

CoRR, 2017

Synchronizing automata and the language of minimal reset words.

[BibT_eX]

[DOI]

CoRR, 2017

On the complexity of the word problem for automaton semigroups and automaton groups.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2017

2016

Ideal regular languages and strongly connected synchronizing automata.

[BibT_eX]

[DOI]

Rogério Reis

Theor. Comput. Sci., 2016

Semisimple Synchronizing Automata and the Wedderburn-Artin Theory.

[BibT_eX]

[DOI]

Jorge Almeida

Int. J. Found. Comput. Sci., 2016

Boundary action of automaton groups without singular points and Wang tilings.

[BibT_eX]

[DOI]

CoRR, 2016

2015

The lamplighter group ℤ<sub>3</sub> wr ℤ generated by a bireversible automaton.

[BibT_eX]

[DOI]

I. Bondarenko

CoRR, 2015

New reformulations of Cerny's conjecture and related problems.

[BibT_eX]

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

Representation of (Left) Ideal Regular Languages by Synchronizing Automata.

[BibT_eX]

[DOI]

Marina I. Maslennikova

Proceedings of the Computer Science - Theory and Applications, 2015

2014

Groups and semigroups defined by colorings of synchronizing automata.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2014

On the freeness of automata groups.

[BibT_eX]

[DOI]

CoRR, 2014

A geometric approach to (semi)-groups defined by automata via dual transducers.

[BibT_eX]

[DOI]

CoRR, 2014

2013

On periodic Points of Free inverse Monoid Homomorphisms.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2013

A multi-lane traffic simulation model via continuous cellular automata

[BibT_eX]

[DOI]

Öznur Yeldan

CoRR, 2013

Regular Ideal Languages and Synchronizing Automata.

[BibT_eX]

[DOI]

Rogério Reis

Proceedings of the Combinatorics on Words - 9th International Conference, 2013

2012

On periodic points of free inverse monoid endomorphisms

[BibT_eX]

[DOI]

CoRR, 2012

Fixed points of endomorphisms of trace monoids

[BibT_eX]

[DOI]

CoRR, 2012

2011

State Complexity of Code Operators.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2011

Multilinear Equations in Amalgams of Finite Inverse Semigroups.

[BibT_eX]

[DOI]

Alessandra Cherubini

C. Nuccio

Int. J. Algebra Comput., 2011

Synchronizing automata with finitely many minimal synchronizing words.

[BibT_eX]

[DOI]

Inf. Comput., 2011

Never Minimal Automata and the Rainbow Bipartite Subgraph Problem.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory - 15th International Conference, 2011

Recognizing Synchronizing Automata with Finitely Many Minimal Synchronizing Words is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the Models of Computation in Context, 2011

2010

Bicyclic Subsemigroups in Amalgams of Finite Inverse Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2010

State Complexity of Prefix, Suffix, Bifix and Infix Operators on Regular Languages.

[BibT_eX]

[DOI]

Proceedings of the Developments in Language Theory, 14th International Conference, 2010

2009

Alphabetical Satisfiability Problem for Trace Equations.

[BibT_eX]

[DOI]

Acta Cybern., 2009

Finitely Generated Synchronizing Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2009

State Complexity For Prefix, Suffix and Bifix operators on regular languages.

[BibT_eX]

Proceedings of the Theoretical Computer Science, 11th Italian Conference, 2009

2008

Mortality Problem for 2×2 Integer Matrices.

[BibT_eX]

[DOI]

C. Nuccio