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

DOI10.1007/S11047-013-9364-YMaRDI QIDQ256709zbMATH OpenOpenAlexFDO

Authors Stavros Konstantinidis, N. 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

algorithmautomatoncodeDNA encodingsmaximalregular languagesubword closure

Mathematics Subject Classification ID

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

Recommendations

• Computing maximal Kleene closures that are embeddable in a given constrained DNA language
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• DNA Coding Using the Subword Closure Operation
• An approach to computing downward closures

Cites work

• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• scientific article; zbMATH DE number 2087004 (Why is no real title available?)
• Aspects of Molecular Computing
• DNA Coding Using the Subword Closure Operation
• DNA Computing
• DNA Computing
• DNA Computing
• DNA computing. 13th international meeting on DNA computing, DNA13, Memphis, TN, USA, June 4--8, 2007. Revised selected papers
• 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 sequence design using templates
• Elements of automata theory. Translated from the French by Reuben Thomas
• STATE COMPLEXITY OF THE SUBWORD CLOSURE OPERATION WITH APPLICATIONS TO DNA CODING
• Schema for parallel insertion and deletion: revisited

Cited in

(3)

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

Describes a project that uses

Uses Software

• DNASequenceGenerator

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

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