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

DOI10.1007/s10711-014-0024-xzbMath1322.20049arXiv1403.1722OpenAlexW3104270914MaRDI QIDQ2256271

Daniele D'Angeli, Emanuele Rodaro

Publication date: 19 February 2015

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.1722

zbMATH Keywords

automata groupsSchreier graphsdynamics on the boundarysemigroups defined by automataStallings construction

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45) Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Freeness of automaton groups vs boundary dynamics ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ On bireversible Mealy automata and the Burnside problem ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ On a class of poly-context-free groups generated by automata ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Lifts, derandomization, and diameters of Schreier graphs of Mealy automata ⋮ Fragile words and Cayley type transducers ⋮ Boundary dynamics for bireversible and for contracting automaton groups ⋮ Infinite automaton semigroups and groups have infinite orbits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a family of Schreier graphs of intermediate growth associated with a self-similar group
• Some topics in the dynamics of group actions on rooted trees.
• Automata generating free products of groups of order 2.
• On a series of finite automata defining free transformation groups.
• Schreier graphs of the Basilica group.
• Stallings foldings and subgroups of free groups
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• Groups defined by automata
• Fixed points of endomorphisms of virtually free groups.
• The spectra of lamplighter groups and Cayley machines.
• On a free group of transformations defined by an automaton.
• Implementing Computations in Automaton (Semi)groups
• Groups and semigroups defined by colorings of synchronizing automata
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Totally nonfree actions and infinite symmetric group
• Self-similar groups acting essentially freely on the boundary of the binary rooted tree