Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1310.5242

Groups and Semigroups Defined by Colorings of Synchronizing Automata

Daniele D'Angeli·Emanuele Rodaro
View original source ↗Read source document ↗Export metadata ↓

Abstract

In this paper we combine the algebraic properties of Mealy machines generating self-similar groups and the combinatorial properties of the corresponding deterministic finite automata (DFA). In particular, we relate bounded automata to finitely generated synchronizing automata and characterize finite automata groups in terms of nilpotency of the corresponding DFA. Moreover, we present a decidable sufficient condition to have free semigroups in an automaton group. A series of examples and applications is widely discussed, in particular we show a way to color the De Bruijn automata into Mealy automata whose associated semigroups are free, and we present some structural results related to the associated groups.

Explore related subjects

math.GRcs.FLmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Daniele D'Angeli, Emanuele Rodaro. 2013-10-19. Groups and Semigroups Defined by Colorings of Synchronizing Automata. https://doi.org/10.1142/s0218196714500337

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Subindices and subfactors of $\mathbb{Z}_n$ and $k$-index stability of finite groups

We study subindices, subfactors, and index stability in the cyclic group $\mathbb{Z}_n$. We prove several theorems that not only confirm a conjecture and resolve some open problems about index stability of such groups, but also provide basic tools for the characterization of finite $k$-index stable groups. As a consequence, we completely characterize all 2-element index stable subsets of $\mathbb{Z}_n$, obtain an exact closed formula for their density, and determine all $n$ for which every 2-subset is index unstable. Finally, we present some problems and a research project extending the study to 3-subsets and general $k$-subsets.

math.GR↗
arXiv2026

Virtually generating graphs of pro-$p$ groups

We study the virtually generating graph of pro-$p$ groups. We show that various classes of pro-$p$ groups have connected virtually generating graph and we bound its diameter in these cases; e.g.\ compact subgroups of analytic groups over local fields and the Nottingham group.

math.GR↗
arXiv2026

Surface subgroups of Baumslag doubles along short words

If $U$ is a minimal, diskbusting, finite list of words in a free group $F_n$ of rank $n$ such that the sum of the lengths of words in $U$ is at most $2n+4$, we prove that the natural presentation complex of the Baumslag double of $F_n$ along $U$ virtually contains a $π_1$-injective embedded closed hyperbolic surface. This verifies the Tiling Conjecture of Kim and Wilton for this type of lists of words, and in particular, implies that the corresponding Baumslag double contains a hyperbolic surface subgroup.

math.GR↗