95 search results - page 3 / 19 » Combinatorics on words |
114
Voted
TCS
2011
14 years 10 months ago
2011
124
Voted
COMBINATORICS
1998
15 years 3 months ago
1998
We prove that the minimal length of a word Sn having the property that it contains exactly Fm+2 distinct subwords of length m for 1 ≤ m ≤ n is Fn + Fn+2. Here Fn is the nth Fi...
85
Voted
CPM
2005
Springer
15 years 9 months ago
2005
Springer
116
Voted
DM
2008
15 years 3 months ago
2008
In this paper we study sequential dynamical systems (SDS) over words. Our main result is the classification of SDS over words for fixed graphY and family of local maps (Fvi ) by m...
199
Voted
TCS
2008
15 years 3 months ago
2008
A subsequence is obtained from a string by deleting any number of characters; thus in contrast to a substring, a subsequence is not necessarily a contiguous part of the string. Co...