Computing maximal Kleene closures that are embeddable in a given constrained DNA language

DOI10.1007/978-3-642-23638-9_11MaRDI QIDQ3092337zbMATH OpenOpenAlexFDO

Authors Stavros Konstantinidis, N. Sântean

Publication date 16 September 2011

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23638-9_11

zbMATH Keywords

automatonDNA encodingsKleene closurepolynomial time algorithmregular languagestructural characterizationsubword closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• DNA Coding Using the Subword Closure Operation
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• On properties of bond-free DNA languages
• Sticky-free and overhang-free DNA languages

Cites work

• DNA Coding Using the Subword Closure Operation
• DNA Computing
• DNA Computing
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• Elements of automata theory. Translated from the French by Reuben Thomas
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• Schema for parallel insertion and deletion
• Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING

Cited in

(3)

• Computing maximal Kleene closures that are embeddable in a given subword-closed language
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• DNA Coding Using the Subword Closure Operation

This page was built for publication: Computing maximal Kleene closures that are embeddable in a given constrained DNA language

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3092337)