Coding properties of DNA languages.

DOI10.1016/S0304-3975(02)00069-5zbMath1044.68095OpenAlexW2076127862MaRDI QIDQ1401178

Stavros Konstantinidis, Lila Kari, Salah Hussini

Publication date: 17 August 2003

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(02)00069-5

zbMATH Keywords

DNA computationsDNA-based system

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (17)

Some properties of involution codes ⋮ Watson-Crick Partial Words ⋮ FORMAL DESCRIPTIONS OF CODE PROPERTIES: DECIDABILITY, COMPLEXITY, IMPLEMENTATION ⋮ Duplications and Pseudo-Duplications ⋮ Decidability of involution hypercodes ⋮ Testing DNA code words properties of regular languages ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ Some properties of related involution palindrome words ⋮ Bond-free DNA language classes ⋮ Some properties of involution binary relations ⋮ A note of solutions to the morphic involution language equations ⋮ Pseudo-inversion: closure properties and decidability ⋮ On properties of bond-free DNA languages ⋮ Watson-Crick palindromes in DNA computing ⋮ Some properties of involution palindrome languages ⋮ Solutions to the involution language equation ⋮ Theoretical and implementational aspects of the formal language server (LaSer)

Cites Work

• Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors
• DNA computing: Arrival of biological mathematics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coding properties of DNA languages.