On codes defined by binary relations. I: Embedding problem

zbMATH Open1251.94015MaRDI QIDQ719792FDOQ719792

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

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

zbMATH Keywords

codeindependent setembedding problemtree representation

Mathematics Subject Classification ID

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

Cited In (13)

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

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)