BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS

DOI10.1142/S0129054105003467zbMath1090.68046OpenAlexW2099378738MaRDI QIDQ5704382

Lila Kari, Stavros Konstantinidis, Petr Sosík

Publication date: 14 November 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054105003467

zbMATH Keywords

DNA computingDNA languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (7)

Unnamed Item ⋮ Transducer descriptions of DNA code properties and undecidability of antimorphic problems ⋮ STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING ⋮ Bond-free DNA language classes ⋮ k-involution codes and related sets ⋮ Watson-Crick palindromes in DNA computing ⋮ DNA Coding Using the Subword Closure Operation

Cites Work

• DNA sequence design using templates
• On language equations with invertible operations
• Sticky-free and overhang-free DNA languages
• Unnamed Item
• Unnamed Item

This page was built for publication: BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS