From automatic structures to automatic groups.

DOI10.4171/GGD/221zbMath1322.20025arXiv1107.3645MaRDI QIDQ2016098

Bakhadyr Khoussainov, O. G. Kharlampovich, Alexei G. Myasnikov

Publication date: 19 June 2014

Published in: Groups, Geometry, and Dynamics (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphs; word problem; finitely generated nilpotent groups; solvable groups; Cayley graph automatic groups

Mathematics Subject Classification ID

20F19: Generalizations of solvable and nilpotent groups

20F65: Geometric group theory

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

Related Items

The inclusion structure of partially lossy queue monoids and their trace submonoids, Quasi-automatic semigroups, Unnamed Item, BEING CAYLEY AUTOMATIC IS CLOSED UNDER TAKING WREATH PRODUCT WITH VIRTUALLY CYCLIC GROUPS, On the geometry of Cayley automatic groups, AUTOMATIC AND POLYNOMIAL-TIME ALGEBRAIC STRUCTURES, FOUNDATIONS OF ONLINE STRUCTURE THEORY, A combination theorem for affine tree-free groups, Thompson's group \(F\) is 1-counter graph automatic., Algorithms and topology of Cayley graphs for groups., Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals, Higher rank lamplighter groups are graph automatic, Semiautomatic structures, The monoid of queue actions, Geometry of the word problem for 3-manifold groups, The complexity of verbal languages over groups, Cayley polynomial-time computable groups, Lamplighter groups and automata, An example of an automatic graph of intermediate growth, String compression in FA-presentable structures, Tree languages and branched groups, Cayley Automatic Groups and Numerical Characteristics of Turing Transducers, Metric properties of Baumslag–Solitar groups, Finitely Generated Semiautomatic Groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Model-theoretic complexity of automatic structures
• Logical aspects of Cayley-graphs: the group case
• Wreath products and finitely presented groups
• Automata, groups, limit spaces, and tilings.
• Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
• Formal language theory and the geometry of 3-manifolds
• Combings of groups and the grammar of reparameterization.
• Automatic groups: A guided tour
• Introduction to group theory. Translated from the Russian. With a new chapter.
• Three Lectures on Automatic Structures
• ON A GENERALIZATION OF DEHN'S ALGORITHM
• Some two-generator one-relator non-Hopfian groups
• Recursively presentable prime models
• Automatic linear orders and trees
• Automatic Structures: Richness and Limitations
• First-order and counting theories ofω-automatic structures
• Definability in the monadic second-order theory of successor