On the maximality of languages with combined types of code properties
From MaRDI portal
Publication:401313
DOI10.1016/J.TCS.2014.07.015zbMATH Open1360.68563OpenAlexW2072220447MaRDI QIDQ401313FDOQ401313
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Uniqueness Theorems for Periodic Functions
- Completing comma-free codes
- Sur le théorème du defaut
- Maximal codes with bounded deciphering delay
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Completion of recognizable bifix codes
- Codes defined by multiple sets of trajectories
- Codes and local constraints
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)
