On codes defined by binary relations. I: Embedding problem

MaRDI QIDQ719792zbMATH OpenFDO

Authors Do Long Van, Kieu Van Hung

Publication date 12 October 2011

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

Full work available at URL http://www.math.ac.vn/publications/vjm/VJM_39/159.htm

zbMATH Keywords

codeembedding problemindependent settree representation

Mathematics Subject Classification ID

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

Recommendations

• On some classes of codes defined by binary relations
• Theoretical Aspects of Computing – ICTAC 2005
• Codes concerning roots of words
• Completing codes
• Embedding rationally independent languages into maximal ones

Cited in

(13)

• On some classes of codes defined by binary relations
• Codes concerning roots of words
• Embedding a -invariant code into a complete one
• On maximality for some kinds of codes over two-letter alphabets
• scientific article; zbMATH DE number 3889592 (Why is no real title available?)
• Each regular code is included in a maximal regular code
• Shuffle Relations and Codes
• Relativized codes
• Embedding rationally independent languages into maximal ones
• Theoretical Aspects of Computing – ICTAC 2005
• Some properties of extractable codes and insertable codes
• On codes defined by binary relations. II: Characterizations and maximality
• An embedding algorithm for supercodes and sucypercodes

This page was built for publication: On codes defined by binary relations. I: Embedding problem

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