Results 21 to 30 of about 3,800,669 (273)
Unavoidable Sets of Partial Words [PDF]
Theory of Computing Systems, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri +2 more
exaly +4 more sources
Discrete Applied Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F Blanchet-Sadri, Robert Mercaş
exaly +3 more sources
Electronic Proceedings in Theoretical Computer Science, 2011 Partial words are sequences over a finite alphabet that may contain wildcard symbols, called holes, which match or are compatible with all letters; partial words without holes are said to be full words (or simply words). Given an infinite partial word w,
Francine Blanchet-Sadri +4 more
doaj +4 more sources
Effects of word length, contextual support, and prior second language proficiency on the learning of technical words in a second language. [PDF]
PLoS ONESecond language (L2) learners often struggle with learning technical words in a new discipline. Previous studies suggested that word length and context may differentially affect orthographic and semantic acquisition during initial L2 word learning.
Jie Wang, Yen Na Yum
doaj +2 more sources
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
Abelian repetitions in partial words
Advances in Applied Mathematics, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Blanchet-Sadri, S. Simmons, D. Xu
semanticscholar +2 more sources
Squares and primitivity in partial words
Discrete Applied Mathematics, 2015 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Blanchet-Sadri +4 more
semanticscholar +3 more sources
Regular languages of partial words
Information Sciences, 2014 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
J. Dassow, Florin Manea, Robert Mercaş
semanticscholar +3 more sources
The three-squares lemma for partial words with one hole
Theoretical Computer Science, 2012 Partial words, or sequences over a finite alphabet that may have do-not-know symbols or holes, have been recently the subject of much investigation. Several interesting combinatorial properties have been studied such as the periodic behavior and the ...
F Blanchet-Sadri, Robert Mercaş
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