| Nome |
# |
|
Topological Properties of Cellular Automata on Trees, file e3ad8916-5e65-da0e-e053-3705fe0a2b96
|
213
|
|
Reverse-Safe Data Structures for Text Indexing, file e3ad8920-653b-da0e-e053-3705fe0a2b96
|
172
|
|
A Classification of Trapezoidal Words, file e3ad8916-5c78-da0e-e053-3705fe0a2b96
|
160
|
|
Bacteria classification using minimal absent words, file e3ad8921-e4e3-da0e-e053-3705fe0a2b96
|
141
|
|
Alignment-free sequence comparison using absent words, file e3ad891e-6c07-da0e-e053-3705fe0a2b96
|
139
|
|
Adaptive learning of compressible strings, file e3ad8927-6b5f-da0e-e053-3705fe0a2b96
|
53
|
|
Constructing Antidictionaries of Long Texts in Output-Sensitive Space, file e3ad8927-1eae-da0e-e053-3705fe0a2b96
|
44
|
|
Anti-powers in infinite words, file e3ad8924-5d13-da0e-e053-3705fe0a2b96
|
28
|
|
On prefix normal words and prefix normal forms, file e3ad891a-e3a7-da0e-e053-3705fe0a2b96
|
22
|
|
Minimal Absent Words in Rooted and Unrooted Trees, file e3ad8920-8f02-da0e-e053-3705fe0a2b96
|
22
|
|
Some Remarks on Differentiable Sequences and Recursivity, file e3ad8916-4a26-da0e-e053-3705fe0a2b96
|
19
|
|
Anti-powers in infinite words, file e3ad8926-f61c-da0e-e053-3705fe0a2b96
|
16
|
|
Primitive sets of words, file 76bb974f-a306-4a2a-8f1e-f95b866086ad
|
15
|
|
Abelian powers and repetitions in Sturmian words, file e3ad8919-8e9d-da0e-e053-3705fe0a2b96
|
15
|
|
Reverse-Safe Text Indexing, file caecff62-d46e-4aae-a89f-10b6f178179a
|
14
|
|
Factorizations of the Fibonacci infinite word, file e3ad8918-57b1-da0e-e053-3705fe0a2b96
|
13
|
|
Maximal Closed Substrings, file 21c0ec72-4289-4ab9-b160-52d13b1918b4
|
11
|
|
On the Impact of Morphisms on BWT-Runs, file 95abdca8-59de-486c-b8ac-85199f3c9568
|
10
|
|
Properties of a class of Toeplitz words, file 0a1f1aa0-e051-4d94-a93b-4e08a0618e8f
|
8
|
|
Substring Complexity in Sublinear Space, file 61eac509-d14a-4161-b25a-74c6377b4ad4
|
7
|
|
On the Lie complexity of Sturmian words, file 6d5db2fd-739f-4a51-b430-86b842396ce5
|
5
|
|
Cyclic complexity of words, file e3ad8926-14b7-da0e-e053-3705fe0a2b96
|
5
|
|
Preface, file 19f1d6c1-da1f-4d47-a06b-dfed7323b256
|
4
|
|
Abelian antipowers in infinite words, file 243ee45f-d9ce-4ef1-8799-aaaeeebccf0f
|
4
|
|
Abelian combinatorics on words: a survey, file d3c2dbc7-a23f-4242-bd69-2d9952449efe
|
4
|
|
On The Maximum Number of Abelian Squares in a Word, file e3ad8917-0563-da0e-e053-3705fe0a2b96
|
4
|
|
On the Lie complexity of Sturmian words, file d3813637-c249-4daa-88da-c264dd6a94f3
|
3
|
|
Online Computation of Abelian Runs, file e3ad8918-4ed3-da0e-e053-3705fe0a2b96
|
3
|
|
Words with the maximum number of abelian squares, file e3ad8918-58d1-da0e-e053-3705fe0a2b96
|
3
|
|
On the Number of Closed Factors in a Word, file e3ad8918-5a42-da0e-e053-3705fe0a2b96
|
3
|
|
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word, file e410727a-339a-43d8-8041-34c9ce660ebd
|
3
|
|
Abelian antipowers in infinite words, file e4cdd1f9-ecc5-449a-9191-25c441d98b6a
|
3
|
|
Minimal forbidden factors of circular words, file 5427401b-6ec9-4479-8b0a-42896eb0a024
|
2
|
|
Abelian combinatorics on words: a survey, file 8fea2c3d-6f66-4de0-afe6-c00572ffa60b
|
2
|
|
Splicing Systems from Past to Future: Old and New Challenges, file e3ad8917-db30-da0e-e053-3705fe0a2b96
|
2
|
|
Open and Closed Words, file e3ad891b-a832-da0e-e053-3705fe0a2b96
|
2
|
|
Minimal forbidden factors of circular words, file e3ad891b-b8c8-da0e-e053-3705fe0a2b96
|
2
|
|
Preface, file e3ad891b-d1f3-da0e-e053-3705fe0a2b96
|
2
|
|
Minimal forbidden factors of circular words, file e3ad891f-896d-da0e-e053-3705fe0a2b96
|
2
|
|
Abelian antipowers in infinite words, file e3ad891f-8fd1-da0e-e053-3705fe0a2b96
|
2
|
|
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word, file e3ad8924-1f76-da0e-e053-3705fe0a2b96
|
2
|
|
Primitive sets of words, file e3ad8927-1eaf-da0e-e053-3705fe0a2b96
|
2
|
|
Properties of a class of Toeplitz words, file f7a8dd52-2a51-494b-8a4f-9aacf3c49034
|
2
|
|
On The Least Number of Palindromes in an Infinite Word, file e3ad8916-582c-da0e-e053-3705fe0a2b96
|
1
|
|
On the least number of palindromes contained in an infinite word, file e3ad8916-588e-da0e-e053-3705fe0a2b96
|
1
|
|
On the structure of bispecial Sturmian words, file e3ad8916-c819-da0e-e053-3705fe0a2b96
|
1
|
|
A subquadratic algorithm for minimum palindromic factorization, file e3ad8916-c81a-da0e-e053-3705fe0a2b96
|
1
|
|
Cyclic complexity of words, file e3ad8916-d780-da0e-e053-3705fe0a2b96
|
1
|
|
The sequence of open and closed prefixes of a Sturmian word, file e3ad891a-c884-da0e-e053-3705fe0a2b96
|
1
|
|
Fast computation of abelian runs, file e3ad891b-6903-da0e-e053-3705fe0a2b96
|
1
|
|
Anti-powers in infinite words, file e3ad891b-a76d-da0e-e053-3705fe0a2b96
|
1
|
|
Constructing Antidictionaries in Output-Sensitive Space, file e3ad891f-8fd6-da0e-e053-3705fe0a2b96
|
1
|
|
Minimal Absent Words in Rooted and Unrooted Trees, file e3ad8920-7060-da0e-e053-3705fe0a2b96
|
1
|
|
On Sets of Words of Rank Two, file e3ad8921-0ced-da0e-e053-3705fe0a2b96
|
1
|
|
Bacteria classification using minimal absent words, file e3ad8922-0895-da0e-e053-3705fe0a2b96
|
1
|
|
Adaptive learning of compressible strings, file e3ad8927-69bd-da0e-e053-3705fe0a2b96
|
1
|
| Totale |
1.201 |