Two optimal parallel algorithms on the commutation class of a word (Q1882917): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2004.03.048 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2000242366 / rank | |||
Revision as of 12:56, 21 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two optimal parallel algorithms on the commutation class of a word |
scientific article |
Statements
Two optimal parallel algorithms on the commutation class of a word (English)
0 references
1 October 2004
0 references
automaton
0 references
commutation class
0 references
parallel algorithm
0 references
partially commutative monoid
0 references
