Automaton (semi)groups: Wang tilings and Schreier tries
From MaRDI portal
Publication:4613554
Recommendations
Cites work
- scientific article; zbMATH DE number 1574582 (Why is no real title available?)
- scientific article; zbMATH DE number 3873585 (Why is no real title available?)
- scientific article; zbMATH DE number 53661 (Why is no real title available?)
- scientific article; zbMATH DE number 557216 (Why is no real title available?)
- scientific article; zbMATH DE number 2156384 (Why is no real title available?)
- scientific article; zbMATH DE number 2195483 (Why is no real title available?)
- scientific article; zbMATH DE number 3220420 (Why is no real title available?)
- scientific article; zbMATH DE number 3389248 (Why is no real title available?)
- A connected 3-state reversible Mealy automaton cannot generate an infinite Burnside group
- A geometric approach to (semi)-groups defined by automata via dual transducers.
- A small aperiodic set of Wang tiles
- An aperiodic set of 11 Wang tiles
- An aperiodic set of 13 Wang tiles
- Automata and square complexes.
- Automata generating free products of groups of order 2.
- Automata, dynamical systems, and groups
- Automatic semigroups vs automaton semigroups
- Automaton semigroup constructions.
- Automaton semigroups
- Automaton semigroups: new constructions results and examples of non-automaton semigroups
- Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
- Boundary dynamics for bireversible and for contracting automaton groups
- CONJUGATION IN TREE AUTOMORPHISM GROUPS
- Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
- Foundations of Garside theory
- Garside and quadratic normalisation: a survey
- Growth of Schreier graphs of automaton groups.
- How groups grow.
- Knight tiles: particles and collisions in the realm of 4-way deterministic tilings
- ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
- On Burnside's problem on periodic groups
- On level-transitivity and exponential growth
- On the Limit Sets of Cellular Automata
- On the conjugacy problem for finite-state automorphisms of regular rooted trees. With an appendix by Raphaël M. Jungers
- On torsion-free semigroups generated by invertible reversible Mealy automata
- Orbit automata as a new tool to attack the order problem in automaton groups
- Periodicity and Immortality in Reversible Computing
- Permutive one-way cellular automata and the finiteness problem for automaton groups
- Quadratic normalization in monoids
- SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
- Solution of the restricted Burnside problem for 2-groups
- The Nilpotency Problem of One-Dimensional Cellular Automata
- The conjugacy problem in automaton groups is not solvable.
- The finiteness problem for automaton semigroups is undecidable.
- The undecidability of the domino problem
Cited in
(4)
This page was built for publication: Automaton (semi)groups: Wang tilings and Schreier tries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4613554)