FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION
From MaRDI portal
Publication:2909182
DOI10.1142/S0129054112400059zbMath1279.68149MaRDI QIDQ2909182
Stavros Konstantinidis, Krystian Dudzinski
Publication date: 30 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
complexity; properties; automata; maximality; decidability; implementation; codes; languages; transducers; descriptions
68Q45: Formal languages and automata
Related Items
Descriptional Complexity of Error Detection, Randomized generation of error control codes with automata and transducers, On the maximality of languages with combined types of code properties, Transducer descriptions of DNA code properties and undecidability of antimorphic problems, Implementation of Code Properties via Transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Codes defined by multiple sets of trajectories
- Rational equivalence relations
- Shuffle on trajectories: Syntactic constraints
- Transducers and the decidability of independence in free monoids
- Coding properties of DNA languages.
- Language equations, maximality and error-detection
- On properties of bond-free DNA languages
- Squaring transducers: An efficient procedure for deciding functionality and sequentiality.
- Trajectory-based codes
- Thin and slender languages
- A note on finite-valued and finitely ambiguous transducers
- Relations on free monoids, their independent sets, and codes1
- Decidability of code properties
- Finite maximal solid codes
