Automaton (semi)groups: Wang tilings and Schreier tries

DOI10.1007/978-3-319-69152-7_10zbMATH Open1486.20043OpenAlexW2797245815MaRDI QIDQ4613554FDOQ4613554

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

Recommendations

• Growth of Schreier graphs of automaton groups.
• The finiteness problem for automaton semigroups is undecidable.
• Automaton semigroups: the two-state case.
• Amenability of linear-activity automaton groups
• Graph automaton groups

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Algebraic theory of languages and automata (68Q70) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

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

Cited In (2)

• Boundary dynamics for bireversible and for contracting automaton groups
• Title not available (Why is that?)

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)