research
∙
02/01/2023
Rudin-Shapiro Sums Via Automata Theory and Logic
We show how to obtain, via a unified framework provided by logic and aut...
share
research
∙
01/15/2023
Dyck Words, Pattern Avoidance, and Automatic Sequences
We study various aspects of Dyck words appearing in binary sequences, wh...
research
∙
09/20/2022
Complement Avoidance in Binary Words
The complement x of a binary word x is obtained by changing each 0 in x ...
research
∙
09/19/2022
Antisquares and Critical Exponents
The complement xÌ… of a binary word x is obtained by changing each 0 in x...
research
∙
06/03/2022
Properties of a Ternary Infinite Word
We study the properties of the ternary infinite word p = 012102101021012...
research
∙
06/06/2021
Closed Ziv-Lempel factorization of the m-bonacci words
A word w is said to be closed if it has a proper factor x which occurs e...
research
∙
06/17/2020
Extremal overlap-free and extremal β-free binary words
An overlap-free (or β-free) word w over a fixed alphabet Σ is extremal i...
research
∙
05/24/2020
An inequality for the number of periods in a word
We prove an inequality for the number of periods in a word x in terms of...
research
∙
01/31/2020
Lengths of extremal square-free ternary words
A square-free word w over a fixed alphabet Σ is extremal if every word o...
research
∙
12/23/2019
The Weak Circular Repetition Threshold Over Large Alphabets
The repetition threshold for words on n letters, denoted (n), is the inf...
research
∙
11/13/2019
The Number of Threshold Words on n Letters Grows Exponentially for Every n≥ 27
For every n≥ 27, we show that the number of n/(n-1)^+-free words (i.e., ...
research
∙
05/03/2019
Palindromic Ziv-Lempel and Crochemore Factorizations of m-Bonacci Infinite Words
We introduce a variation of the Ziv-Lempel and Crochemore factorizations...
research
∙
04/19/2019
