Computing the closure of sets of words under partial commutations (Q4645168): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/3-540-60084-1_64 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1581738459 / rank | |||
Normal rank | |||
Revision as of 19:28, 19 March 2024
scientific article; zbMATH DE number 6999422
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the closure of sets of words under partial commutations |
scientific article; zbMATH DE number 6999422 |
Statements
Computing the closure of sets of words under partial commutations (English)
0 references
10 January 2019
0 references
commutation
0 references
recognizability
0 references
rank
0 references
star problem
0 references
trace monoids
0 references
