On the maximality of languages with combined types of code properties

DOI10.1016/j.tcs.2014.07.015zbMath1360.68563OpenAlexW2072220447MaRDI QIDQ401313

Stavros Konstantinidis, Steffen Kopecki, Lila Kari

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

decidabilitydeciphering delaysyntactic monoidscode propertiesdecoding delaymaximal codes

Mathematics Subject Classification ID

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

Related Items (4)

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

Cites Work

• Completion of recognizable bifix codes
• Codes defined by multiple sets of trajectories
• Codes and local constraints
• Sur le théorème du defaut
• Maximal codes with bounded deciphering delay
• Completing comma-free codes
• Finite maximal infix codes
• Language equations, maximality and error-detection
• Trajectory-based codes
• Completing prefix codes in submonoids.
• FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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