745 search results - page 10 / 149 » The origins of combinatorics on words |
LATA
2010
Springer
15 years 1 months ago
2010
Springer
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
IANDC
2007
14 years 10 months ago
2007
We study words on a finite alphabet avoiding a finite collection of patterns. Given a pattern p in which every letter that occurs in p occurs at least twice, we show that the nu...
RECOMB
2002
Springer
15 years 10 months ago
2002
Springer
The problem of characterizing and detecting recurrent sequence patterns such as substrings or motifs and related associations or rules is variously pursued in order to compress da...
COMBINATORICS
2006
14 years 10 months ago
2006
In the game of Penney Ante two players take turns publicly selecting two distinct words of length n using letters from an alphabet of size q. They roll a fair q sided die having ...
100
click to vote
COMBINATORICS
2007
14 years 10 months ago
2007
We determine the limiting distributions of the longest alternating subsequence for pattern-restricted permutations in which the pattern is any one of the six patterns of length th...