On the automaton complexity of wreath powers of non-Abelian finite simple groups. (Q401945)

From MaRDI portal
Revision as of 16:29, 9 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)





scientific article
Language Label Description Also known as
English
On the automaton complexity of wreath powers of non-Abelian finite simple groups.
scientific article

    Statements

    On the automaton complexity of wreath powers of non-Abelian finite simple groups. (English)
    0 references
    0 references
    27 August 2014
    0 references
    permutational wreath products
    0 references
    trees of words
    0 references
    wreath powers
    0 references
    automaton groups
    0 references
    groups generated by automata
    0 references
    automaton realizations
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references