On $z$-submonoids and $z$-codes

DOI10.1051/ita/1991250403051zbMath0764.68089OpenAlexW62766249MaRDI QIDQ3988803

T. Sportelli, Sergio Salemi, Marina 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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

On coding morphisms for zigzag codes ⋮ A generalization of Sardinas and Patterson's algorithm to \(Z\)-codes ⋮ A more efficient notion of zigzag stability

Cites Work

• Unnamed Item
• Unnamed Item
• Two-way automaton computations
• Automates et codes zigzag

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