Results 11 to 20 of about 2,670,857 (211)
Conjugacy on partial words [PDF]
Theoretical Computer Science, 2002 The study of the combinatorial properties of strings of symbols from a finite alphabet (also referred to as words) is profoundly connected to numerous fields such as biology, computer science, mathematics, and physics.
Luhmann, D.K., Blanchet-Sadri, F.
core +5 more sources
Unavoidable Sets of Partial Words [PDF]
Theory of Computing Systems, 2009 The notion of an unavoidable set of words appears frequently in the fields of mathematics and theoretical computer science, in particular with its connection to the study of combinatorics on words.
Blanchet-Sadri, Francine +1 more
core +7 more sources
Unbordered partial words [PDF]
Discrete Applied Mathematics, 2008 An unbordered word is a string over a finite alphabet such that none of its proper prefixes is one of its suffixes. In this paper, we extend the results on unbordered words to unbordered partial words. Partial words are strings that may have a number of “
Davis, C.D. +9 more
core +4 more sources
, 2018 The first print magazine from 1000 Words. 2018 marks the 10th anniversary of 1000 Words, and what better way to celebrate than to publish a special print annual?
Clark, Tim, 1000 Words
core +6 more sources
, 2020 1000 Words is a leading online contemporary photography magazine. It commissions and publishes exhibition and photo book reviews, essays and interviews in response to the visual culture of our present moment.
Clark, Tim, 1000 Words
core +6 more sources
Equations on partial words [PDF]
RAIRO - Theoretical Informatics and Applications, 2006 Summary: It is well-known that some of the most basic properties of words, like the commutativity \((xy = yx)\) and the conjugacy \((xz = zy)\), can be expressed as solutions of word equations. An important problem is to decide whether or not a given equation on words has a solution.
Francine Blanchet-Sadri +2 more
openaire +2 more sources
Pattern avoidance in partial permutations [PDF]
, 2011 Motivated by the concept of partial words, we introduce an analogous concept of partial permutations. A partial permutation of length n with k holes is a sequence of symbols $\pi = \pi_1\pi_2 ...
Claesson, A. +3 more
core +4 more sources
Periods in Partial Words: An Algorithm [PDF]
Journal of Discrete Algorithms, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri +2 more
openaire +2 more sources
On the number of squares in partial words [PDF]
RAIRO - Theoretical Informatics and Applications, 2010 Summary: The theorem of Fraenkel and Simpson states that the maximum number of distinct squares that a word \(w\) of length \(n\) can contain is less than \(2n\). This is based on the fact that no more than two squares can have their last occurrences starting at the same position.
Vesa Halava, Tero Harju, Tomi Kärki
openaire +1 more source
Border Correlations of Partial Words [PDF]
Theory of Computing Systems, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Francine Blanchet-Sadri +2 more
openaire +1 more source