Results 231 to 240 of about 206,490 (252)
Some of the next articles are maybe not open access.
On the Language of Primitive Partial Words
2015A partial word is a word which contains some holes known as do not know symbols and such places can be replaced by any letter from the underlying alphabet. We study the relation between language of primitive partial words with the conventional language classes viz. regular, linear and deterministic context-free in Chomsky hierarchy.
Ananda Chandra Nayak, Kalpesh Kapoor
openaire +1 more source
Squares in Binary Partial Words
2012In this paper, we investigate the number of positions that do not start a square, the number of square occurrences, and the number of distinct squares in binary partial words. Letting σh(n) be the maximum number of positions not starting a square for binary partial words with h holes of length n, we show that limσh(n)/n=15/31 provided the limit of h/n ...
Francine Blanchet-Sadri +2 more
openaire +1 more source
Counting Primitive Partial Words
J. Autom. Lang. Comb., 2010A word is primitive if it is not a power of another word. The number of primitive words of a fixed length over an alphabet of a fixed size is well known and relates to the Möbius function. In this paper, we investigate the number of primitive partial words which are strings that may contain "do not know" symbols.
Francine Blanchet-Sadri, Mihai Cucuringu
openaire +1 more source
Avoidable Binary Patterns in Partial Words
Acta Informatica, 2010The classification of all binary patterns according to partial word avoidability is obtained in this very interesting paper. A new terminology on unavoidable patterns is introduced in order to include some undefined positions called holes. Using iterated morphisms, the construction of binary partial words with infinitely many holes avoiding certain ...
Francine Blanchet-Sadri +3 more
openaire +1 more source
2017
In DNA computing experiments, it is important that the strands involved in the computation do not interact in an undesirable fashion. The mathematical formalization of the DNA WK-complementarity as an antimorphic involution, has motivated the generalization of various concepts in combinatorics of words to ones that involve pseudo-identity functions ...
Manasi S. Kulkarni +2 more
openaire +1 more source
In DNA computing experiments, it is important that the strands involved in the computation do not interact in an undesirable fashion. The mathematical formalization of the DNA WK-complementarity as an antimorphic involution, has motivated the generalization of various concepts in combinatorics of words to ones that involve pseudo-identity functions ...
Manasi S. Kulkarni +2 more
openaire +1 more source
2005
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesired behaviour, especially they should not form secondary structures. Various combinatorial properties like repetition-freeness and involution-freeness have been proposed to ...
openaire +1 more source
A very basic problem in all DNA computations is finding a good encoding. Apart from the fact that they must provide a solution, the strands involved should not exhibit any undesired behaviour, especially they should not form secondary structures. Various combinatorial properties like repetition-freeness and involution-freeness have been proposed to ...
openaire +1 more source
A generalization of Thue freeness for partial words
Theoretical Computer Science, 2009Robert Mercaş, F Blanchet-Sadri
exaly
Testing avoidability on sets of partial words is hard
Theoretical Computer Science, 2009Raphaël Jungers, F Blanchet-Sadri
exaly
Local periods and binary partial words: an algorithm
Theoretical Computer Science, 2004F Blanchet-Sadri
exaly
Overlap-freeness in infinite partial words
Theoretical Computer Science, 2009Tomi Karki, Tero Harju, Vesa Halava
exaly