Sciweavers

95 search results - page 9 / 19
» Combinatorics on words
Sort
View
DAM
2007
85views more  DAM 2007»
13 years 8 months ago
Testing primitivity on partial words
Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language...
Francine Blanchet-Sadri, Arundhati R. Anavekar
SIAMDM
2010
84views more  SIAMDM 2010»
13 years 6 months ago
Complementary Iterated Floor Words and the Flora Game
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
Aviezri S. Fraenkel
CPM
1999
Springer
144views Combinatorics» more  CPM 1999»
14 years 22 days ago
Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays
We present a very efficient, in terms of space and access speed, data structure for storing huge natural language data sets. The structure is described as LZ (Ziv Lempel) compresse...
Strahil Ristov, Eric Laporte
COMBINATORICS
2007
164views more  COMBINATORICS 2007»
13 years 8 months ago
Longest Alternating Subsequences in Pattern-Restricted Permutations
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...
Ghassan Firro, Toufik Mansour, Mark C. Wilson
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
13 years 8 months ago
Permutations Without Long Decreasing Subsequences and Random Matrices
We study the shape of the Young diagram λ associated via the Robinson– Schensted–Knuth algorithm to a random permutation in Sn such that the length of the longest decreasing ...
Piotr Sniady