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

From MaRDI portal
Revision as of 16:51, 5 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Dehn's Algorithm and the Complexity of Word Problems
scientific article

    Statements

    title
    Dehn's Algorithm and the Complexity of Word Problems (English)
    0 references
    DOI
    10.2307/2322385
    0 references
    author
    Ronald V. Book
    0 references
    publication date
    1988
    0 references
    Mathematics Subject Classification ID
    03D40
    0 references
    03D03
    0 references
    20F10
    0 references
    03D15
    0 references
    03-01
    0 references
    zbMATH DE Number
    4101159
    0 references
    zbMATH Keywords
    finite Thue system
    0 references
    rewriting system
    0 references
    linear-time algorithm
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3826535&oldid=17415303"
    Powered by MediaWiki