Relativized codes

DOI10.1016/J.TCS.2011.12.024zbMATH Open1263.94018DBLPjournals/tcs/DaleyJKM12OpenAlexW2912588130WikidataQ62046595 ScholiaQ62046595MaRDI QIDQ418759FDOQ418759

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Codes and automata.
• On the defect theorem and simplifiability
• Deciding the immutability of regular codes and languages under finite transduction
• Title not available (Why is that?)
• Relations on free monoids, their independent sets, and codes¹
• Title not available (Why is that?)
• Title not available (Why is that?)
• Markers and deterministic acceptors for non-deterministic languages
• Coding partitions

Cited In (3)

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

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)