scientific article; zbMATH DE number 2143015

MaRDI QIDQ4654644zbMATH OpenFDO

Authors J. Néraud, C. Selmi

Publication date 8 March 2005

zbMATH Keywords

free monoid

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatorics on words (68R15) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Completing prefix codes in submonoids.
• Machines, Computations, and Universality
• scientific article; zbMATH DE number 5117090
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• On codes having no finite completions

Cited in

(11)

• Locally complete sets and finite decomposable codes
• Description of special submonoids of the global supermonoid of a free monoid
• Completing circular codes in regular submonoids
• Completing prefix codes in submonoids.
• scientific article; zbMATH DE number 5117090 (Why is no real title available?)
• scientific article; zbMATH DE number 125885 (Why is no real title available?)
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• Machines, Computations, and Universality
• Three-word codes \(\{a,aba,u\}\) having a finite completion
• Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
• Codes and maximal monoids

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4654644)