Relativized codes

DOI10.1016/J.TCS.2011.12.024MaRDI QIDQ418759zbMATHOpenAlexDBLPWikidataFDO

Authors Mark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam

Publication date 30 May 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.12.024

zbMATH Keywords

factorizationprefix codeconcatenationdecodingbifix codeDNA encodingoverlap-free coderestricted message spacesolid codesuffix code

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Prefix, length-variable, comma-free codes (94A45) Source coding (94A29) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Methods for relativizing properties of codes
• On some classes of codes defined by binary relations
• Relational codes of words
• scientific article; zbMATH DE number 33205
• On codes defined by binary relations. I: Embedding problem

Cites work

• scientific article; zbMATH DE number 3714974 (Why is no real title available?)
• scientific article; zbMATH DE number 50943 (Why is no real title available?)
• scientific article; zbMATH DE number 3566726 (Why is no real title available?)
• scientific article; zbMATH DE number 522835 (Why is no real title available?)
• scientific article; zbMATH DE number 1458676 (Why is no real title available?)
• Codes and automata.
• Coding partitions
• Deciding the immutability of regular codes and languages under finite transduction
• Markers and deterministic acceptors for non-deterministic languages
• On the defect theorem and simplifiability
• Relations on free monoids, their independent sets, and codes¹

Cited in

(3)

• Automata for solid codes
• Methods for relativizing properties of codes
• Recoverable formal language

This page was built for publication: Relativized codes

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