The finiteness problem for automaton semigroups of extended bounded activity
From MaRDI portal
Cites work
- A new hierarchy for automaton semigroups
- Amenability of discrete groups by examples
- An automaton group with \textsf{PSPACE}-complete word problem
- An automaton group with undecidable order and Engel problems
- Automata, dynamical systems, and groups
- Automatic semigroups vs automaton semigroups
- Automaton semigroup constructions.
- Automaton semigroups
- Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
- Automaton semigroups: new constructions results and examples of non-automaton semigroups
- Automaton semigroups: the two-state case.
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- Discrete algebraic methods. Arithmetic, cryptography, automata and groups
- Groups defined by automata
- Groups of intermediate growth: an introduction.
- scientific article; zbMATH DE number 3664335 (Why is no real title available?)
- scientific article; zbMATH DE number 1284170 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 2169354 (Why is no real title available?)
- scientific article; zbMATH DE number 789816 (Why is no real title available?)
- scientific article; zbMATH DE number 2206109 (Why is no real title available?)
- scientific article; zbMATH DE number 2195483 (Why is no real title available?)
- Implementing computations in automaton (semi)groups
- Infinite automaton semigroups and groups have infinite orbits
- On orbits and the finiteness of bounded automaton groups
- On the complexity of the word problem for automaton semigroups and automaton groups
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- On the structure theory of partial automaton semigroups
- Orbit expandability of automaton semigroups and groups
- Preserving self-similarity in free products of semigroups
- The conjugacy problem in automaton groups is not solvable.
- The finiteness problem for automaton semigroups is undecidable.
- The freeness problem for automaton semigroups
- The word and order problems for self-similar and automata groups
- The word problem for automaton groups
- The word problem for finitary automaton groups
This page was built for publication: The finiteness problem for automaton semigroups of extended bounded activity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7356038)
