Results 11 to 20 of about 3,800,669 (273)
On universal partial words [PDF]
Discrete Mathematics & Theoretical Computer Science, 2017 A universal word for a finite alphabet $A$ and some integer $n\geq 1$ is a word over $A$ such that every word in $A^n$ appears exactly once as a subword (cyclically or linearly).
Herman Z. Q. Chen +3 more
doaj +11 more sources
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Florin Manea, Robert Mercaş
exaly +4 more sources
Theoretical Computer Science, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri, J D Quigley
exaly +4 more sources
Discrete Applied Mathematics, 2005 Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in formal language theory, coding theory, and combinatorics on words to name a few.
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.
F Blanchet-Sadri, Nathan Fox
exaly +3 more sources
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 +4 more sources
Avoiding abelian squares in partial words
Journal of Combinatorial Theory - Series A, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri +2 more
exaly +3 more sources
On Periodicity Lemma for Partial Words [PDF]
Information and Computation, 2018 We investigate the function $L(h,p,q)$, called here the threshold function, related to periodicity of partial words (words with holes). The value $L(h,p,q)$ is defined as the minimum length threshold which guarantees that a natural extension of the ...
Tomasz Kociumaka +3 more
semanticscholar +5 more sources
On universal partial words for word-patterns and set partitions [PDF]
RAIRO - Theoretical Informatics and Applications, 2020 Universal words are words containing exactly once each element from a given set of combinatorial structures admitting encoding by words. Universal partial words (u-p-words) contain, in addition to the letters from the alphabet in question, any number of ...
Herman Z. Q. Chen, S. Kitaev
semanticscholar +4 more sources
Periods in Partial Words: An Algorithm [PDF]
Journal of Discrete Algorithms, 2011 Partial words are finite sequences over a finite alphabet that may contain some holes. A variant of the celebrated Fine-Wilf theorem shows the existence of a bound L=L(h,p,q) such that if a partial word of length at least L with h holes has periods p and
F. Blanchet-Sadri +2 more
semanticscholar +2 more sources