scientific article; zbMATH DE number 7564469

MaRDI QIDQ5091811

Emanuele Rodaro, Dominik Francoeur, Daniele D'Angeli, Jan Philipp Wächter

Publication date: 27 July 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

orbitsreversibleorbital graphsautomaton groupsautomaton semigroupsSchreier graphs

Mathematics Subject Classification ID

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) Structure and classification of infinite or finite groups (20E99) Representation of semigroups; actions of semigroups on sets (20M30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Automaton semigroups: the two-state case.
• Automaton semigroups: new constructions results and examples of non-automaton semigroups
• Automaton semigroup constructions.
• The word and order problems for self-similar and automata groups
• On the structure theory of partial automaton semigroups
• Groups of intermediate growth: an introduction.
• Automaton semigroups
• An automaton group with undecidable order and Engel problems
• The conjugacy problem in automaton groups is not solvable.
• Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
• Infinite automaton semigroups and groups have infinite orbits
• On the complexity of the word problem for automaton semigroups and automaton groups
• Freeness of automaton groups vs boundary dynamics
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Implementing Computations in Automaton (Semi)groups
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE

This page was built for publication: