Bond-free DNA language classes
From MaRDI portal
Publication:2461298
DOI10.1007/s11047-006-9022-8zbMath1130.68061MaRDI QIDQ2461298
Publication date: 27 November 2007
Published in: Natural Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11047-006-9022-8
68Q45: Formal languages and automata
68Q10: Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.)
92D20: Protein sequences, DNA sequences
Related Items
Cites Work
- 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
- Shuffle on trajectories: Syntactic constraints
- Coding properties of DNA languages.
- 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
- Sticky-free and overhang-free DNA languages
- Trajectory-based codes
- On Equivalence and Containment Problems for Formal Languages
- STACS 2004
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS