Graph groups are biautomatic (Q1331906)

From MaRDI portal
Revision as of 16:30, 22 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph groups are biautomatic
scientific article

    Statements

    title
    Graph groups are biautomatic (English)
    0 references
    author
    Leonard Van Wyk
    0 references
    publication date
    9 May 1995
    0 references
    zbMATH Keywords
    commuting clique
    0 references
    presentation
    0 references
    relation
    0 references
    generators
    0 references
    graph groups
    0 references
    free groups
    0 references
    bicombable
    0 references
    normal forms
    0 references
    combings
    0 references
    regular language
    0 references
    free monoid
    0 references
    biautomatic
    0 references

    Identifiers

    Mathematics Subject Classification ID
    20F10
    0 references
    20F05
    0 references
    20E06
    0 references
    20F34
    0 references
    57M07
    0 references
    05C25
    0 references
    20F28
    0 references
    20E05
    0 references
    zbMATH DE Number
    626261
    0 references
    OpenAlex ID
    W1972761586
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1331906&oldid=34130563"
    Powered by MediaWiki