Fragile words and Cayley type transducers

DOI10.22108/ijgt.2017.100358.1398zbMath1446.20043OpenAlexW2780519848MaRDI QIDQ5124053

Emanuele Rodaro, Daniele D'Angeli

Publication date: 17 September 2020

Full work available at URL: https://doaj.org/article/5c90be21f1f643f3ab6544d3bc972120

zbMATH Keywords

automaton groupsfragile wordsCayley type transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10) Groups acting on trees (20E08)

Related Items (2)

Eraser morphisms and membership problem in groups and monoids ⋮ Catalan fragile words

Uses Software

• AutomGrp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Free subgroups in groups acting on rooted trees
• Schreier graphs of the Basilica group.
• Automorphisms of one-rooted trees: growth, circuit structure, and acyclicity.
• Ends of Schreier graphs and cut-points of limit spaces of self-similar groups
• A geometric approach to (semi)-groups defined by automata via dual transducers.
• On the complexity of the word problem for automaton semigroups and automaton groups
• Freeness of automaton groups vs boundary dynamics
• On a free group of transformations defined by an automaton.
• Groups and semigroups defined by colorings of synchronizing automata
• AUTOMATA OVER A BINARY ALPHABET GENERATING FREE GROUPS OF EVEN RANK
• Totally nonfree actions and infinite symmetric group
• Self-similar groups acting essentially freely on the boundary of the binary rooted tree

This page was built for publication: Fragile words and Cayley type transducers