Word problem of the Perkins semigroup via directed acyclic graphs. (Q953264): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s11083-008-9083-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2092388212 / rank | |||
Normal rank | |||
Revision as of 18:55, 19 March 2024
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
