Codes defined by multiple sets of trajectories
From MaRDI portal
Publication:860886
DOI10.1016/J.TCS.2006.08.022zbMath1154.68066OpenAlexW2121693375MaRDI QIDQ860886
Michael Domaratzki, Kai Salomaa
Publication date: 9 January 2007
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.022
Related Items (6)
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 ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Bond-free DNA language classes ⋮ Implementation of Code Properties via Transducers
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Deletion along trajectories
- Codes defined by multiple sets of trajectories
- \(d\)-words and \(d\)-languages
- Shuffle on trajectories: Syntactic constraints
- \(d\)-minimal languages
- Transducers and the decidability of independence in free monoids
- Structure of 3-infix-outfix maximal codes.
- Algebraic properties of the shuffle over \(\omega\)-trajectories
- Language equations, maximality and error-detection
- Aspects of shuffle and deletion on trajectories
- On properties of bond-free DNA languages
- Trajectory-based codes
- Decidability of trajectory-based equations
- Relations on free monoids, their independent sets, and codes1
- n-Prefix–suffix languages∗
- OPERATIONS ON TRAJECTORIES WITH APPLICATIONS TO CODING AND BIOINFORMATICS
- Developments in Language Theory
- \(k\)-p-infix codes and semaphore codes
This page was built for publication: Codes defined by multiple sets of trajectories
