Maximality of codes in free monoids

MaRDI QIDQ1063122zbMATH OpenFDO

Authors Ludwig Staiger

Publication date 1985

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/138318

zbMATH Keywords

maximality of a finite codenondense infinite codes

Mathematics Subject Classification ID

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

Review text

There are conditions (topological and measuretheoretic ones) that are equivalent to maximality of a finite code. It is proved that these conditions together with a new one remain equivalent to maximality in case of nondense infinite codes, but in general they are pairwise non- equivalent.

Recommendations

• scientific article; zbMATH DE number 3926268
• scientific article; zbMATH DE number 4043284
• Monoids and maximal codes
• scientific article; zbMATH DE number 33205
• Full monoids and maximal codes

Cited in

(11)

• Cyclic renewal systems
• An order topology for finitely generated free monoids
• Monoids and maximal codes
• Full monoids and maximal codes
• scientific article; zbMATH DE number 3926268 (Why is no real title available?)
• scientific article; zbMATH DE number 4043284 (Why is no real title available?)
• scientific article; zbMATH DE number 33205 (Why is no real title available?)
• scientific article; zbMATH DE number 672019 (Why is no real title available?)
• scientific article; zbMATH DE number 1740160 (Why is no real title available?)
• scientific article; zbMATH DE number 2068875 (Why is no real title available?)
• Coding and strong coding in trace monoids

This page was built for publication: Maximality of codes in free monoids

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