Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (Q4354236)

From MaRDI portal
Revision as of 13:18, 28 October 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 1060737
Language Label Description Also known as
English
Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem
scientific article; zbMATH DE number 1060737

    Statements

    Time-Complexity of the Word Problem for Semigroups and the Higman Embedding Theorem (English)
    0 references
    15 September 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    finitely generated semigroups
    0 references
    word problem
    0 references
    time complexity
    0 references
    isoperimetric functions
    0 references
    finitely presented semigroups
    0 references