Dehn's Algorithm and the Complexity of Word Problems (Q3826535)

From MaRDI portal
Revision as of 17:23, 19 October 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
Dehn's Algorithm and the Complexity of Word Problems
scientific article

    Statements

    Dehn's Algorithm and the Complexity of Word Problems (English)
    0 references
    0 references
    0 references
    1988
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    finite Thue system
    0 references
    rewriting system
    0 references
    linear-time algorithm
    0 references