On codes defined by binary relations. II: Characterizations and maximality

MaRDI QIDQ763588zbMATH OpenFDO

Authors Do Long Van, Kieu Van Hung

Publication date 29 March 2012

Published in Vietnam Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

independent setembedding problemParikh vectorsucypercodessupercodessuperinfix codes

Mathematics Subject Classification ID

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

Recommendations

• On maximality for some kinds of codes over two-letter alphabets
• An embedding algorithm for supercodes and sucypercodes
• On codes defined by binary relations. I: Embedding problem
• On some classes of codes defined by binary relations
• Theoretical Aspects of Computing – ICTAC 2005

Cited in

(5)

• On maximality for some kinds of codes over two-letter alphabets
• Theoretical Aspects of Computing – ICTAC 2005
• On some classes of codes defined by binary relations
• An embedding algorithm for supercodes and sucypercodes
• On alphabetic coding for superwords

This page was built for publication: On codes defined by binary relations. II: Characterizations and maximality

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