Results 221 to 230 of about 206,490 (252)
On minimal Sturmian partial words
Discrete Applied Mathematics, 2011 The subword complexity \(p_w (n)\) of a word \(w\) is the function that maps \(n\) to the number of distinct length-\(n\) factors occurring in \(w\). A partial word is a word with a ``don't care'' symbol \(\diamond\) that matches every other symbol. The notion of subword complexity can be extended to partial words \(w\) by counting the total number of ...
F Blanchet-Sadri
exaly +5 more sources
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri
exaly +3 more sources
Abelian-primitive partial words
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nathan Fox, F Blanchet-Sadri
exaly +2 more sources
Testing primitivity on partial words
Discrete Applied Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri
exaly +3 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
On the Periods of Partial Words
2001In [1], partial words were defined to be partial mappings of a set {1, ..., n} to a finite alphabet. We continue the research of periodic partial words started in that paper. The main goal is to clarify the interaction of different periods of a word.
Arseny M. Shur, Yulia V. Konovalova
openaire +1 more source
The hardness of counting full words compatible with partial words
Journal of Computer and System Sciences, 2013 AbstractWe present several problems regarding counting full words compatible with a set of partial words or with the factors of a partial word, and show that they are #P-complete. Some of these counting problems have NP-complete decision counterparts to which a hard variant of CNF-SAT is reduced parsimoniously; the rest are #P-complete problems that ...
Florin Manea
exaly +3 more sources
2013
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages.
Eric Balkanski +3 more
openaire +1 more source
Recently, Dassow et al. connected partial words and regular languages. Partial words are sequences in which some positions may be undefined, represented with a "hole" symbol ⋄. If we restrict what the symbol ⋄ can represent, we can use partial words to compress the representation of regular languages.
Eric Balkanski +3 more
openaire +1 more source
2007
Partial words are strings over a finite alphabet that may contain a number of "do not know" symbols. In this paper, we introduce the notions of binary and ternary correlations, which are binary and ternary vectors indicating the periods and weak periods of partial words. Extending a result of Guibas and Odlyzko, we characterize precisely which of these
Francine Blanchet-Sadri +2 more
openaire +1 more source
Partial words are strings over a finite alphabet that may contain a number of "do not know" symbols. In this paper, we introduce the notions of binary and ternary correlations, which are binary and ternary vectors indicating the periods and weak periods of partial words. Extending a result of Guibas and Odlyzko, we characterize precisely which of these
Francine Blanchet-Sadri +2 more
openaire +1 more source
Avoiding abelian squares in partial words
Journal of Combinatorial Theory - Series A, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Mercaş +2 more
exaly +2 more sources
ALGORITHMIC COMBINATORICS ON PARTIAL WORDS
International Journal of Foundations of Computer Science, 2012Algorithmic combinatorics on partial words, or sequences of symbols over a finite alphabet that may have some do-not-know symbols or holes, has been developing in the past few years. Applications can be found, for instance, in molecular biology for the sequencing and analysis of DNA, in bio-inspired computing where partial words have been considered ...
openaire +2 more sources