FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS

DOI10.1142/S0218196703001584zbMath1064.68076OpenAlexW2091274708MaRDI QIDQ4464961

Jean Néraud, Carla Selmi

Publication date: 27 May 2004

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196703001584

zbMATH Keywords

strongly \(M\)-thin codes

Mathematics Subject Classification ID

Combinatorics on words (68R15) Free semigroups, generators and relations, word problems (20M05) Prefix, length-variable, comma-free codes (94A45)

Related Items (4)

Completing circular codes in regular submonoids ⋮ Codes and maximal monoids ⋮ Completing prefix codes in submonoids. ⋮ Pseudo-cyclic renewal systems

Cites Work

• Unnamed Item
• On completion of codes with finite deciphering delay
• Systèmes codés. (Coded systems)
• On generators of rational \(\omega\)-power languages
• Sur le théorème du defaut
• Finitely generated bi\(\omega\)-languages
• Finitely generated sofic systems
• On maximal codes with bounded synchronization delay
• On maximal synchronous codes.
• Locally complete sets and finite decomposable codes
• Each regular code is included in a maximal regular code
• Completing codes
• An Introduction to Symbolic Dynamics and Coding

This page was built for publication: FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS