Automaton (Semi)groups: Wang Tilings and Schreier Tries

DOI10.1007/978-3-319-69152-7_10zbMath1486.20043OpenAlexW2797245815MaRDI QIDQ4613554

Matthieu Picantin, Ines Klimann

Publication date: 24 January 2019

Published in: Trends in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-69152-7_10

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) Combinatorial aspects of tessellation and tiling problems (05B45)

Related Items

Unnamed Item, Boundary dynamics for bireversible and for contracting automaton groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Growth of Schreier graphs of automaton groups.
• Automaton semigroups: new constructions results and examples of non-automaton semigroups
• Automata generating free products of groups of order 2.
• Automaton semigroup constructions.
• Orbit automata as a new tool to attack the order problem in automaton groups
• Automaton semigroups
• On Burnside's problem on periodic groups
• An aperiodic set of 13 Wang tiles
• A small aperiodic set of Wang tiles
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• On level-transitivity and exponential growth
• The conjugacy problem in automaton groups is not solvable.
• Permutive one-way cellular automata and the finiteness problem for automaton groups
• A geometric approach to (semi)-groups defined by automata via dual transducers.
• Foundations of Garside theory
• Automata and square complexes.
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Quadratic normalization in monoids
• Implementing Computations in Automaton (Semi)groups
• Knight Tiles: Particles and Collisions in the Realm of 4-Way Deterministic Tilings
• On the Limit Sets of Cellular Automata
• ON A CLASS OF AUTOMATA GROUPS GENERALIZING LAMPLIGHTER GROUPS
• Garside and Quadratic Normalisation: A Survey
• A Connected 3-State Reversible Mealy Automaton Cannot Generate an Infinite Burnside Group
• SOLUTION OF THE RESTRICTED BURNSIDE PROBLEM FOR GROUPS OF ODD EXPONENT
• Periodicity and Immortality in Reversible Computing
• The Nilpotency Problem of One-Dimensional Cellular Automata
• Connected reversible Mealy automata of prime size cannot generate infinite Burnside groups
• CONJUGATION IN TREE AUTOMORPHISM GROUPS
• An aperiodic set of 11 Wang tiles
• Boundary dynamics for bireversible and for contracting automaton groups
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
• The undecidability of the domino problem