Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language

DOI10.1007/978-3-642-23638-9_11zbMath1347.68207OpenAlexW52186638MaRDI QIDQ3092337

Stavros Konstantinidis, Nicolae 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

structural characterizationpolynomial time algorithmregular languageDNA encodingsautomatonsubword closureKleene closure

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• DNA computing. 10th international workshop on DNA computing, DNA10, Milan, Italy, June 7--10, 2004. Revised selected papers
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• Schema for Parallel Insertion and Deletion
• Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
• DNA Coding Using the Subword Closure Operation
• DNA Computing
• DNA Computing

This page was built for publication: Computing Maximal Kleene Closures That Are Embeddable in a Given Constrained DNA Language