Very little is known about the structure of the intersection of two k-generated monoids of words, even for k=3. Here we investigate the case of k-maximal monoids, that is, monoids whose basis of cardinality k cannot be non-trivially decomposed into at most k words. We characterize the intersection in the case of two 3-maximal monoids.
Castiglione G., Holub S. (2022). The intersection of 3-maximal submonoids. THEORETICAL COMPUTER SCIENCE, 901, 35-44 [10.1016/j.tcs.2021.11.024].
The intersection of 3-maximal submonoids
Castiglione G.
;
2022-01-12
Abstract
Very little is known about the structure of the intersection of two k-generated monoids of words, even for k=3. Here we investigate the case of k-maximal monoids, that is, monoids whose basis of cardinality k cannot be non-trivially decomposed into at most k words. We characterize the intersection in the case of two 3-maximal monoids.
File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
1-s2.0-S0304397521006976-main.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
418.98 kB
Formato
Adobe PDF
|
418.98 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
articolo.pdf
Solo gestori archvio
Tipologia:
Versione Editoriale
Dimensione
3.3 MB
Formato
Adobe PDF
|
3.3 MB | Adobe PDF | Visualizza/Apri Richiedi una copia |
|
Intersection_of__3__maximal.pdf
accesso aperto
Tipologia:
Pre-print
Dimensione
321.55 kB
Formato
Adobe PDF
|
321.55 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
