From automatic structures to automatic groups. (Q2016098)

From MaRDI portal
Revision as of 12:31, 30 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
From automatic structures to automatic groups.
scientific article

    Statements

    From automatic structures to automatic groups. (English)
    0 references
    0 references
    0 references
    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
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references