The problem of the commutative equivalence of semigroups generated by semi-linear languages is studied. In particular conditions ensuring that the Kleene closure of a bounded semi-linear code is commutatively equivalent to a regular language are investigated.
On Bounded Linear Codes and the Commutative Equivalence / Carpi, Arturo; D'Alessandro, Flavio. - In: THEORETICAL COMPUTER SCIENCE. - ISSN 0304-3975. - 852:(2021), pp. 185-196. [10.1016/j.tcs.2020.11.031]
On Bounded Linear Codes and the Commutative Equivalence
D'ALESSANDRO FLAVIO
2021
Abstract
The problem of the commutative equivalence of semigroups generated by semi-linear languages is studied. In particular conditions ensuring that the Kleene closure of a bounded semi-linear code is commutatively equivalent to a regular language are investigated.File allegati a questo prodotto
| File | Dimensione | Formato | |
|---|---|---|---|
|
Carpi_On-Bounded-linear-codes_2020.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
297.68 kB
Formato
Adobe PDF
|
297.68 kB | Adobe PDF | Contatta l'autore |
|
Carpi_preprint_On-Bounded-linear-codes_2020.pdf
accesso aperto
Note: preprint, versione preliminare alla
Tipologia:
Documento in Pre-print (manoscritto inviato all'editore, precedente alla peer review)
Licenza:
Creative commons
Dimensione
310.47 kB
Formato
Adobe PDF
|
310.47 kB | Adobe PDF |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
