research
∙
09/06/2023
A General Approach to Proving Properties of Fibonacci Representations via Automata Theory
We provide a method, based on automata theory, to mechanically prove the...
share
research
∙
08/12/2023
Proving properties of some greedily-defined integer recurrences via automata theory
Venkatachala on the one hand, and Avdispahić Zejnulahi on the other,...
research
∙
05/04/2023
Proving Properties of φ-Representations with the Walnut Theorem-Prover
We revisit a classic theorem of Frougny and Sakarovitch concerning autom...
research
∙
03/27/2023
Transduction of Automatic Sequences and Applications
We consider the implementation of the transduction of automatic sequence...
research
∙
02/25/2023
Smallest and Largest Block Palindrome Factorizations
A palindrome is a word that reads the same forwards and backwards. A blo...
research
∙
02/09/2023
Prefixes of the Fibonacci word
Mignosi, Restivo, and Salemi (1998) proved that for all ϵ > 0 there exis...
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...
research
∙
01/27/2023
Proof of a conjecture of Krawchuk and Rampersad
We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal beh...
research
∙
01/15/2023
Dyck Words, Pattern Avoidance, and Automatic Sequences
We study various aspects of Dyck words appearing in binary sequences, wh...
research
∙
12/23/2022
Counterexamples to a Conjecture of Dombi in Additive Number Theory
We disprove a 2002 conjecture of Dombi from additive number theory. More...
research
∙
10/08/2022
Some Tribonacci Conjectures
In a recent talk of Robbert Fokkink, some conjectures related to the inf...
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
∙
08/11/2022
Automatic Sequences in Negative Bases and Proofs of Some Conjectures of Shevelev
We discuss the use of negative bases in automatic sequences. Recently th...
research
∙
07/20/2022
Pseudoperiodic Words and a Question of Shevelev
We generalize the familiar notion of periodicity in sequences to a new k...
research
∙
06/03/2022
Properties of a Ternary Infinite Word
We study the properties of the ternary infinite word p = 012102101021012...
research
∙
03/20/2022
Note on a Fibonacci Parity Sequence
Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in...
research
∙
03/06/2022
Intertwining of Complementary Thue-Morse Factors
We consider the positions of occurrences of a factor x and its binary co...
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
∙
08/11/2021
Automatic Sequences of Rank Two
Given a right-infinite word x over a finite alphabet A, the rank of x is...
research
∙
07/29/2021
Mesosome Avoidance
We consider avoiding mesosomes – that is, words of the form xx' with x' ...
research
∙
06/02/2021
Hilbert's spacefilling curve described by automatic, regular, and synchronized sequences
We describe Hilbert's spacefilling curve in several different ways: as a...
research
∙
03/19/2021
Frobenius Numbers and Automatic Sequences
The Frobenius number g(S) of a set S of non-negative integers with 1 is ...
research
∙
02/16/2021
Decidability for Sturmian words
We show that the first-order theory of Sturmian words over Presburger ar...
research
∙
02/07/2021
Lie complexity of words
Given a finite alphabet Σ and a right-infinite word w over Σ, we define ...
research
∙
12/12/2020
String Attractors for Automatic Sequences
We show that it is decidable, given an automatic sequence s and a consta...
research
∙
11/01/2020
Abelian Complexity and Synchronization
We present a general method for computing the abelian complexity ρ^ ab_ ...
research
∙
10/21/2020
Subword complexity of the Fibonacci-Thue-Morse sequence: the proof of Dekking's conjecture
Recently Dekking conjectured the form of the subword complexity function...
research
∙
08/03/2020
The Largest Entry in the Inverse of a Vandermonde Matrix
We investigate the size of the largest entry (in absolute value) in the ...
research
∙
07/29/2020
Robbins and Ardila meet Berstel
In 1996, Neville Robbins proved the amazing fact that the coefficient of...
research
∙
07/16/2020
The Simplest Binary Word with Only Three Squares
We re-examine previous constructions of infinite binary words containing...
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
∙
06/07/2020
Sumsets of Wythoff Sequences, Fibonacci Representation, and Beyond
Let α = (1+√(5))/2 and define the lower and upper Wythoff sequences by a...
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
∙
05/19/2020
A Frameless 2-Coloring of the Plane Lattice
A picture frame in two dimensions is a rectangular array of symbols, wit...
research
∙
05/19/2020
Decidability and k-Regular Sequences
In this paper we consider a number of natural decision problems involvin...
research
∙
02/07/2020
Computational Aspects of Sturdy and Flimsy Numbers
Following Stolarsky, we say that a natural number n is flimsy in base b ...
research
∙
02/05/2020
Avoidance of split overlaps
We generalize Axel Thue's familiar definition of overlaps in words, and ...
research
∙
12/17/2019
New Bounds on Antipowers in Binary Words
Fici et al. defined a word to be a k-power if it is the concatenation of...
research
∙
11/27/2019
Words With Few Palindromes, Revisited
In 2013, Fici and Zamboni proved a number of theorems about finite and i...
research
∙
11/26/2019
Words Avoiding Reversed Factors, Revisited
In 2005, Rampersad and the second author proved a number of theorems abo...
research
∙
06/09/2019
Borders, Palindrome Prefixes, and Square Prefixes
We show that the number of length-n words over a k-letter alphabet havin...
research
∙
04/19/2019
New results on pseudosquare avoidance
We start by considering binary words containing the minimum possible num...
research
∙
04/17/2019
Circularly squarefree words and unbordered conjugates: a new approach
Using a new approach based on automatic sequences, logic, and a decision...
research
∙
03/13/2019
Generalized de Bruijn words and the state complexity of conjugate sets
We consider a certain natural generalization of de Bruijn words, and use...
research
∙
02/01/2019
Critical exponent of infinite balanced words via the Pell number system
In a recent paper of Rampersad et al., the authors conjectured that the ...
research
∙
08/07/2018
Circular critical exponents for Thue-Morse factors
We prove various results about the largest exponent of a repetition in a...
research
∙
02/13/2018
Lengths of Words Accepted by Nondeterministic Finite Automata
We consider two natural problems about nondeterministic finite automata....
research
∙
01/25/2018
Rollercoasters and Caterpillars
A rollercoaster is a sequence of real numbers for which every maximal co...
research
∙
01/16/2018
