On the commutative equivalence of bounded semi-linear codes

DOI10.1007/978-3-030-28796-2_9zbMath1436.68165OpenAlexW2970245023MaRDI QIDQ2333035

Arturo Carpi, Flavio D'Alessandro

Publication date: 6 November 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-28796-2_9

zbMATH Keywords

exponential growthcommutative equivalenceuniquely decipherable codeKleene closurebounded semi-linear language

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (2)

On the Commutative Equivalence of Algebraic Formal Series and Languages ⋮ On bounded linear codes and the commutative equivalence

This page was built for publication: On the commutative equivalence of bounded semi-linear codes