Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Word problem of the Perkins semigroup via directed acyclic graphs. |
scientific article; zbMATH DE number 5366783
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Word problem of the Perkins semigroup via directed acyclic graphs. |
scientific article; zbMATH DE number 5366783 |
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.65038913
0 references
0 references
0.64501804
0 references
0 references
