On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata

DOI10.1007/978-3-319-15579-1_25zbMath1405.68197arXiv1410.4488OpenAlexW2963744602MaRDI QIDQ2799184

Matthieu Picantin, Thibault Godin, Ines Klimann

Publication date: 8 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

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

zbMATH Keywords

automaton semigrouplabeled orbit treereversible Mealy automatontorsion-free semigroup

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (14)

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ On bireversible Mealy automata and the Burnside problem ⋮ Orbit automata as a new tool to attack the order problem in automaton groups ⋮ Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness ⋮ An automaton group with undecidable order and Engel problems ⋮ A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Algorithmic Decidability of Engel’s Property for Automaton Groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Generic properties in some classes of automaton groups ⋮ Boundary dynamics for bireversible and for contracting automaton groups ⋮ On the existence of free subsemigroups in reversible automata semigroups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
• On amenability of automata groups.
• On transition functions of Mealy automata of finite growth.
• Automaton semigroups
• On Burnside's problem on periodic groups
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Groups defined by automata
• The smallest Mealy automaton of intermediate growth.
• Implementing Computations in Automaton (Semi)groups
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
• Some Unsolvable Problems about Elements and Subgroups of Groups.
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• Classification of groups generated by 3-state automata over a 2-letter alphabet
• CAYLEY AUTOMATON SEMIGROUPS
• ON THE CAYLEY SEMIGROUP OF A FINITE APERIODIC SEMIGROUP
• CONJUGATION IN TREE AUTOMORPHISM GROUPS
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE

This page was built for publication: On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata