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

Authors:
Stavros Konstantinidis;Nicolae Santean
Affiliations:
Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Canada B3H 3C3;Department of Mathematics and Computing Science, Saint Mary's University, Halifax, Canada B3H 3C3
Venue:
Natural Computing: an international journal
Year:
2013

Citing 11
Cited 0

Molecular computation of solutions to combinatorial problems

Science
Handbook of formal languages, vol. 1: word, language, grammar

Handbook of formal languages, vol. 1: word, language, grammar
Regular languages

Handbook of formal languages, vol. 1
Automata for matching patterns

Handbook of formal languages, vol. 2
DNA sequence design using templates

New Generation Computing
Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Algorithms

Algorithms
Elements of Automata Theory

Elements of Automata Theory
DNA coding using the subword closure operation

DNA13'07 Proceedings of the 13th international conference on DNA computing
Towards domain-based sequence design for DNA strand displacement reactions

DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Bond-free languages: formalizations, maximality and construction methods

DNA'04 Proceedings of the 10th international conference on DNA computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Motivated by certain coding techniques for reliable DNA computing, we consider the problem of characterizing nontrivial languages D that are maximal with the property that D * is contained in the subword closure of a given set S of words of some fixed length k. This closure is simply the set of all words whose subwords of length k must be in S. We provide a deep structural characterization of these languages D, which leads to polynomial time algorithms for computing such languages.