scientific article; zbMATH DE number 7561617

DOI10.4230/LIPIcs.ICALP.2019.124MaRDI QIDQ5092326

Matthieu Picantin

Publication date: 21 July 2022

Full work available at URL: https://arxiv.org/abs/1609.09364

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semigroupself-similarityrewriting systemautomaticitymealy machine

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (5)

On the complexity of the word problem for automaton semigroups and automaton groups ⋮ Self-similar monoids related to Hahn groups ⋮ Cyclic amalgams, HNN extensions, and Garside one-relator groups ⋮ Automaton (Semi)groups: Wang Tilings and Schreier Tries ⋮ Automaton semigroups: new constructions results and examples of non-automaton semigroups

Uses Software

• AutomGrp
• FR

Cites Work

• 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
• Automaton semigroups: new constructions results and examples of non-automaton semigroups
• 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
• Automatic semigroups
• A new hierarchy for automaton semigroups
• A non-Hopfian automatic group
• Foundations of Garside theory
• Finite transducers for divisibility monoids
• On the immersion of an algebraic ring into a field
• On Torsion-Free Semigroups Generated by Invertible Reversible Mealy Automata
• Quadratic normalization in monoids
• Implementing Computations in Automaton (Semi)groups
• The finiteness of a group generated by a 2-letter invertible-reversible Mealy automaton is decidable
• Groups and Automata: A Perfect Match
• 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
• Automaton (Semi)groups: Wang Tilings and Schreier Tries
• Rewriting systems and biautomatic structures for Chinese, hypoplactic, and sylvester monoids
• THE FINITENESS PROBLEM FOR AUTOMATON SEMIGROUPS IS UNDECIDABLE
• An asymmetric generalisation of Artin monoids
• Faithful Group Actions on Rooted Trees Induced by Actions of Quotients
• Fundamentals of Computation Theory

This page was built for publication: