On the maximality of languages with combined types of code properties

DOI10.1016/J.TCS.2014.07.015MaRDI QIDQ401313zbMATH OpenOpenAlexFDO

Authors Lila Kari, Stavros Konstantinidis, Steffen Kopecki

Publication date 26 August 2014

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

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

zbMATH Keywords

decidabilitysyntactic monoidscode propertiesdeciphering delaydecoding delaymaximal codes

Mathematics Subject Classification ID

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

Recommendations

• Maximal codes with bounded deciphering delay
• scientific article; zbMATH DE number 3950378
• Formal descriptions of code properties: decidability, complexity, implementation
• Decidability of code properties
• Decidability of code properties

Cites work

• scientific article; zbMATH DE number 5117090 (Why is no real title available?)
• scientific article; zbMATH DE number 3654376 (Why is no real title available?)
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 3763326 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 1354855 (Why is no real title available?)
• scientific article; zbMATH DE number 1024080 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Codes and local constraints
• Codes defined by multiple sets of trajectories
• Completing comma-free codes
• Completing prefix codes in submonoids.
• Completion of recognizable bifix codes
• Finite maximal infix codes
• Formal descriptions of code properties: decidability, complexity, implementation
• Language equations, maximality and error-detection
• Maximal codes with bounded deciphering delay
• Sur le théorème du defaut
• Trajectory-based codes
• Uniqueness Theorems for Periodic Functions

Cited in

(6)

• Variable-length codes independent or closed with respect to edit relations
• Decidability of code properties
• Decidability of code properties
• Topologies for error-detecting variable-length codes
• Generalizations of Code Languages with Marginal Errors
• When variable-length codes meet the field of error detection

This page was built for publication: On the maximality of languages with combined types of code properties

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