The freeness problem for automaton semigroups

Cites work

A new hierarchy for automaton semigroups
A variant of a recursively unsolvable problem
Amenability of discrete groups by examples
An automaton group with undecidable order and Engel problems
Automata and square complexes.
Automata over a binary alphabet generating free groups of even rank.
Automata, dynamical systems, and groups
Automatic semigroups vs automaton semigroups
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.
Corrigendum to: ``Automaton semigroups and groups: on the undecidability of problems related to freeness and finiteness
Groups defined by automata
Groups of intermediate growth: an introduction.
Growth of Schreier graphs of automaton groups.
scientific article; zbMATH DE number 3574107 (Why is no real title available?)
scientific article; zbMATH DE number 789816 (Why is no real title available?)
scientific article; zbMATH DE number 2195483 (Why is no real title available?)
Infinite automaton semigroups and groups have infinite orbits
Lamplighter groups, bireversible automata, and rational series over finite rings
ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
On a free group of transformations defined by an automaton.
On a series of finite automata defining free transformation groups.
On finite semigroups of matrices
On the Burnside problem for periodic 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
ON THE UNDECIDABILITY OF FREENESS OF MATRIX SEMIGROUPS
ON THE UNDECIDABILITY OF THE FREENESS OF INTEGER MATRIX SEMIGROUPS
Reachability problems in quaternion matrix and rotation semigroups
The conjugacy problem in automaton groups is not solvable.
The finiteness problem for automaton semigroups is undecidable.
The Generation of GL(n, Z) by Finite State Automata
The lamplighter group as a group generated by a 2-state automaton, and its spectrum
The word and order problems for self-similar and automata groups
The word problem for automaton groups
The word problem for finitary automaton groups
To infinity and beyond
Undecidability in binary tag systems and the Post correspondence problem for five pairs of words

This page was built for publication: The freeness problem for automaton semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241046)