Computing maximal Kleene closures that are embeddable in a given subword-closed language

DOI10.1007/S11047-013-9364-YzbMath1332.68119OpenAlexW2077823020MaRDI QIDQ256709

Stavros Konstantinidis, Nicolae Sântean

Publication date: 10 March 2016

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-013-9364-y

zbMATH Keywords

algorithmregular languagecodeDNA encodingsautomatonmaximalsubword closure

Mathematics Subject Classification ID

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

Uses Software

• DNASequenceGenerator

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• DNA sequence design using templates
• DNA computing. 7th international workshop on DNA-based computers, DNA7, Tampa, FL, USA, June 10--13, 2001. Revised papers
• DNA computing. 9th international workshop on DNA based computers, DNA9, Madison, WI, USA, June 1--3, 2003. Revised papers.
• DNA computing. 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4--8, 2007. Revised selected papers
• SCHEMA FOR PARALLEL INSERTION AND DELETION: REVISITED
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• DNA Coding Using the Subword Closure Operation
• DNA Computing
• DNA Computing
• DNA Computing
• Aspects of Molecular Computing

This page was built for publication: Computing maximal Kleene closures that are embeddable in a given subword-closed language