Embedding rationally independent languages into maximal ones

DOI10.25596/JALC-2016-311MaRDI QIDQ4590911zbMATH OpenFDO

Authors Stavros Konstantinidis, Mitja Mastnak

Publication date 20 November 2017

Full work available at URL https://arxiv.org/abs/1507.00600

zbMATH Keywords

embeddingerror control codeslanguagesmaximal codestransducersvariable-length codes

Mathematics Subject Classification ID

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

Recommendations

• On codes defined by binary relations. I: Embedding problem
• Theoretical Aspects of Computing – ICTAC 2005
• On some classes of codes defined by binary relations
• Completing codes
• scientific article; zbMATH DE number 1254094

Cited in

(10)

• Theoretical and implementational aspects of the formal language server (LaSer)
• Approximate NFA universality motivated by information theory
• Every regular bifix code is a finite union of regular infix codes
• Approximate NFA universality and related problems motivated by information theory
• When variable-length codes meet the field of error detection
• Zero-Avoiding Transducers, Length Separable Relations, and the Rational Asymmetric Partition Problem
• Topologies for error-detecting variable-length codes
• Three-word codes \(\{a,aba,u\}\) having a finite completion
• Three-word codes \(\{a, aba, u\}\) and \(\{a, ab, v\}\) having finite completions
• On codes defined by binary relations. I: Embedding problem

This page was built for publication: Embedding rationally independent languages into maximal ones

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