Computing the closure of sets of words under partial commutations (Q4645168)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6999422
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.799437940120697
0 references
0.7670062184333801
0 references
0.7661715149879456
0 references
