From automatic structures to automatic groups. (Q2016098)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: From automatic structures to automatic groups. |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | From automatic structures to automatic groups. |
scientific article |
Statements
From automatic structures to automatic groups. (English)
0 references
19 June 2014
0 references
The authors introduce the concept of a Cayley graph automatic group which generalizes the standard notion of an automatic group. Like the usual automatic groups the Cayley graph automatic groups enjoy many nice properties. In particular, the word problem in these groups is decidable in quadratic time. This class is much wider than the class of automatic groups. For example, all finitely generated nilpotent of class two groups and Baumslag-Solitar groups \(BS(1,n)\) are Cayley graph automatic.
0 references
Cayley graph automatic groups
0 references
Cayley graphs
0 references
word problem
0 references
finitely generated nilpotent groups
0 references
solvable groups
0 references
