Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264)

From MaRDI portal
Revision as of 19:23, 28 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
Word problem of the Perkins semigroup via directed acyclic graphs.
scientific article

    Statements

    Word problem of the Perkins semigroup via directed acyclic graphs. (English)
    0 references
    0 references
    0 references
    0 references
    17 November 2008
    0 references
    Brandt monoid
    0 references
    word problem
    0 references
    word graphs
    0 references
    computational complexity
    0 references

    Identifiers

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