Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (Q1123619)

From MaRDI portal
Revision as of 09:09, 20 June 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
Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems
scientific article

    Statements

    Some polynomial-time algorithms for finite monadic Church-Rosser Thue systems (English)
    0 references
    0 references
    0 references
    1989
    0 references
    finite monadic Church-Rosser Thue systems
    0 references
    rewriting systems
    0 references
    uniform decision problems
    0 references
    uniform conjugacy problem
    0 references

    Identifiers

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