DNA Computing

DOI10.1007/B136914MaRDI QIDQ5494352zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

Recommendations

• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS
• scientific article; zbMATH DE number 3880130
• scientific article; zbMATH DE number 5519566
• 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

Cited in

(6)

• Computing maximal Kleene closures that are embeddable in a given constrained DNA language
• Hairpin Structures in DNA Words
• Bond-free DNA language classes
• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• Efficient Algorithm for Testing Structure Freeness of Finite Set of Biomolecular Sequences
• BOND-FREE LANGUAGES: FORMALIZATIONS, MAXIMALITY AND CONSTRUCTION METHODS

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)