Cayley Automatic Groups and Numerical Characteristics of Turing Transducers

DOI10.1007/978-3-662-53132-7_3zbMath1436.20059arXiv1606.08357OpenAlexW2963544589MaRDI QIDQ2817373

Dmitry Berdinsky

Publication date: 30 August 2016

Published in: Developments in Language Theory (Search for Journal in Brave)

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

zbMATH Keywords

random walkgrowth functionCayley automatic groupsFølner functionTuring transducers

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Geometric group theory (20F65) Extensions, wreath products, and other compositions of groups (20E22) Word problems, other decision problems, connections with logic and automata (group-theoretic aspects) (20F10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Deterministic automata. Simulation, universality and minimality
• On isoperimetric profiles of finitely generated groups.
• Finite nondeterministic automata: simulation and minimality
• On the asymptotics of drift
• Rational and transcendental growth series for the higher Heisenberg groups
• From automatic structures to automatic groups.
• An example of an automatic graph of intermediate growth
• Cayley Automatic Representations of Wreath Products
• On Automatic Transitive Graphs
• Three Lectures on Automatic Structures
• An example of the rate of growth for a random walk on a group
• STACS 2005
• Approach for incorporating narrow band nonuniformity into nongray analyis of radiative heat transfer in nonisothermal and nonhomogeneous gas fields

This page was built for publication: Cayley Automatic Groups and Numerical Characteristics of Turing Transducers