An example of an automatic graph of intermediate growth

DOI10.1016/j.apal.2015.05.005zbMath1322.68125arXiv1312.3710MaRDI QIDQ2352257

Dmytro Savchuk, Alexei G. Myasnikov

Publication date: 30 June 2015

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

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

zbMATH Keywords

intermediate growth; Schreier graph; automatic structure; automatic graph; Cayley automatic group

Mathematics Subject Classification ID

68Q45: Formal languages and automata

20F65: Geometric group theory

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

03D05: Automata and formal grammars in connection with logical questions

20F10: Word problems, other decision problems, connections with logic and automata (group-theoretic aspects)

Related Items

Endomorphisms of regular rooted trees induced by the action of polynomials on the ring ℤd of d-adic integers, SOLENOIDAL MAPS, AUTOMATIC SEQUENCES, VAN DER PUT SERIES, AND MEALY AUTOMATA, Schreier graphs of actions of Thompson's group \(F\) on the unit interval and on the Cantor set, Cayley Automatic Groups and Numerical Characteristics of Turing Transducers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(\mathcal C\)-graph automatic groups.
• On a family of Schreier graphs of intermediate growth associated with a self-similar group
• The combinatorial structure of cocompact discrete hyperbolic groups
• Formal language theory and the geometry of 3-manifolds
• Combings of groups and the grammar of reparameterization.
• From automatic structures to automatic groups.
• \(\omega\)-periodic graphs
• Cayley Graph Automatic Groups Are Not Necessarily Cayley Graph Biautomatic
• Tame filling invariants for groups
• Automata Presenting Structures: A Survey of the Finite String Case