research
∙
11/17/2022
Some Results on Digital Segments and Balanced Words
We exhibit combinatorial results on Christoffel words and binary balance...
share
research
∙
09/01/2022
Maximal Closed Substrings
A string is closed if it has length 1 or has a nonempty border without i...
research
∙
07/20/2022
Abelian Combinatorics on Words: a Survey
We survey known results and open problems in abelian combinatorics on wo...
research
∙
06/02/2022
On the Lie complexity of Sturmian words
Bell and Shallit recently introduced the Lie complexity of an infinite w...
research
∙
12/22/2021
Properties of a Class of Toeplitz Words
We study the properties of the uncountable set of Stewart words. These a...
research
∙
11/13/2020
Substring Query Complexity of String Reconstruction
Suppose an oracle knows a string S that is unknown to us and we want to ...
research
∙
07/16/2020
Substring Complexity in Sublinear Space
Shannon's entropy is a definitive lower bound for statistical compressio...
research
∙
05/20/2020
Primitive Sets of Words
Given a (finite or infinite) subset X of the free monoid A^* over a fini...
research
∙
03/05/2020
Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
A prefix normal word is a binary word with the property that no substrin...
research
∙
07/28/2019
Minimal Absent Words in Rooted and Unrooted Trees
We extend the theory of minimal absent words to (rooted and unrooted) tr...
research
∙
02/13/2019
Constructing Antidictionaries in Output-Sensitive Space
A word x that is absent from a word y is called minimal if all its prope...
research
∙
10/29/2018
Abelian Anti-Powers in Infinite Words
An abelian anti-power of order k (or simply an abelian k-anti-power) is ...
research
∙
10/04/2018
On k-Maximal Submonoids, with Applications in Combinatorics on Words
We define the notion of a k-maximal submonoid. A submonoid M is k-maxima...
research
∙
06/07/2018
Alignment-free sequence comparison using absent words
Sequence comparison is a prerequisite to virtually all comparative genom...
research
∙
05/31/2018
On Prefix Normal Words
We present a new class of binary words: the prefix normal words. They ar...
research
∙
05/25/2018
