5 search results - page 1 / 1 » Words Restricted by Patterns with at Most 2 Distinct Letters |
COMBINATORICS
2002
13 years 4 months ago
2002
DAM
2011
12 years 11 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
STACS
2009
Springer
13 years 11 months ago
2009
Springer
The Prefix table of a string reports for each position the maximal length of its prefixes starting here. The Prefix table and its dual Suffix table are basic tools used in the d...
JUCS
2010
13 years 3 months ago
2010
Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text...
JSYML
2010
12 years 11 months ago
2010
A set A of vertices of a graph G is called d-scattered in G if no two d-neighborhoods of (distinct) vertices of A intersect. In other words, A is d-scattered if no two distinct ver...