Completely simple codes

DOI10.1007/S00233-011-9351-5MaRDI QIDQ1939491zbMATH OpenOpenAlexFDO

Authors Yun Liu

Publication date 4 March 2013

Published in Semigroup Forum (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00233-011-9351-5

zbMATH Keywords

complete codecompletely simple codemaximal codesemigroupvariable-length code

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45)

Recommendations

• Groups and decompositions of codes
• On codes having no finite completions
• scientific article; zbMATH DE number 1354855
• scientific article; zbMATH DE number 4185539
• On group codes

Cites work

• Codes and automata.
• Compositions of maximal codes
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 53545 (Why is no real title available?)
• scientific article; zbMATH DE number 1455132 (Why is no real title available?)
• scientific article; zbMATH DE number 789816 (Why is no real title available?)

Cited in

(4)

• Right complete codes
• Groups and decompositions of codes
• Maximal bifix codes of degree 3
• On the groups of codes with empty kernel.

This page was built for publication: Completely simple codes

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