Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264): Difference between revisions
From MaRDI portal
Latest revision as of 20:10, 27 January 2025
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
17 November 2008
0 references
Brandt monoid
0 references
word problem
0 references
word graphs
0 references
computational complexity
0 references
0 references
0.7109217
0 references
0.71014774
0 references
0.70257545
0 references
0.6789162
0 references
0.6612126
0 references
0 references
0.64501804
0 references
0 references