Language equations, maximality and error-detection

DOI10.1016/j.jcss.2004.08.005zbMath1070.68070OpenAlexW2127955734MaRDI QIDQ1765227

Lila Kari, Stavros Konstantinidis

Publication date: 23 February 2005

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2004.08.005

zbMATH Keywords

Closure propertiesMaximal codesError detectionLanguage inequationsLanguage operations

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Channel models (including quantum) in information and communication theory (94A40) Prefix, length-variable, comma-free codes (94A45)

Related Items (8)

FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ Codes defined by multiple sets of trajectories ⋮ On the maximality of languages with combined types of code properties ⋮ Bond-free DNA language classes ⋮ On Language Decompositions and Primality ⋮ Decision problems for language equations ⋮ Aspects of shuffle and deletion on trajectories ⋮ On properties of bond-free DNA languages

Cites Work

• Maximal and minimal solutions to language equations
• On language equations with invertible operations
• Transducers and the decidability of independence in free monoids
• Error-detecting properties of languages
• Relationships between different error-correcting capabilities of a code
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Language equations, maximality and error-detection