On z-submonoids and z-codes

DOI10.1051/ITA/1991250403051MaRDI QIDQ3988803zbMATH OpenOpenAlexFDO

Authors Sergio Salemi, T. Sportelli, Maria Madonia

Publication date 28 June 1992

Published in RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

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

zbMATH Keywords

\(z\)-codes\(z\)-submonoidsmaximal complete codesSchützenberger's theorem

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• On codes having no finite completions
• FREE MONOID THEORY: MAXIMALITY AND COMPLETENESS IN ARBITRARY SUBMONOIDS
• On the factorization of codes
• Machines, Computations, and Universality
• Monoids and maximal codes

Cites work

• Automates et codes zigzag
• scientific article; zbMATH DE number 3943051 (Why is no real title available?)
• scientific article; zbMATH DE number 3976380 (Why is no real title available?)
• Two-way automaton computations

Cited in

(7)

• A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes
• scientific article; zbMATH DE number 1188994 (Why is no real title available?)
• On coding morphisms for zigzag codes
• A more efficient notion of zigzag stability
• scientific article; zbMATH DE number 1394486 (Why is no real title available?)
• Normal submonoids and strong codes
• Zigzag codes and z-free hulls

This page was built for publication: On $z$-submonoids and $z$-codes

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