DNA Computing
From MaRDI portal
Publication:5494352
DOI10.1007/B136914zbMATH Open1116.68457OpenAlexW4248466611MaRDI QIDQ5494352FDOQ5494352
Authors: Lila Kari, Stavros Konstantinidis, Petr Sosík 
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136914
Recommendations
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- scientific article
- scientific article
- scientific article; zbMATH DE number 1502105
- On the formalization of some results of context-free language theory
- Upper bound on syntactic complexity of suffix-free languages
- Syntactic complexity of bifix-free languages
- scientific article; zbMATH DE number 50943
- scientific article; zbMATH DE number 871238
- The boundary of prefix-free languages
Formal languages and automata (68Q45) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)
Cited In (6)
- Computing maximal Kleene closures that are embeddable in a given subword-closed language
- BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
- Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
- Hairpin Structures in DNA Words
- Bond-free DNA language classes
- Computing maximal Kleene closures that are embeddable in a given constrained DNA language
This page was built for publication: DNA Computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5494352)
