Published January 1, 2021
| Version v1
Journal article
Open
On bounded linear codes and the commutative equivalence
Creators
- 1. Univ Perugia, Dipartimento Matemat & Informat, Via Vanvitelli 1, I-06123 Perugia, Italy
Description
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. (C) 2020 Elsevier B.V. All rights reserved.
Files
bib-223ad662-9e0e-4c67-b5c6-e70096c0354f.txt
Files
(143 Bytes)
| Name | Size | Download all |
|---|---|---|
|
md5:93695b3b78e40b38ab46bf590bdfacd3
|
143 Bytes | Preview Download |