We provide a method, based on automata theory, to mechanically prove the...
Venkatachala on the one hand, and Avdispahić Zejnulahi on the other,...
We revisit a classic theorem of Frougny and Sakarovitch concerning autom...
We consider the implementation of the transduction of automatic sequence...
A palindrome is a word that reads the same forwards and backwards. A
blo...
Mignosi, Restivo, and Salemi (1998) proved that for all ϵ > 0 there
exis...
We show how to obtain, via a unified framework provided by logic and aut...
We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal beh...
We study various aspects of Dyck words appearing in binary sequences, wh...
We disprove a 2002 conjecture of Dombi from additive number theory. More...
In a recent talk of Robbert Fokkink, some conjectures related to the inf...
The complement x of a binary word x is obtained by changing
each 0 in x ...
The complement x̅ of a binary word x is obtained by changing each
0 in x...
We discuss the use of negative bases in automatic sequences. Recently th...
We generalize the familiar notion of periodicity in sequences to a new k...
We study the properties of the ternary infinite word p =
012102101021012...
Let ftm = 0111010010001... be the analogue of the Thue-Morse sequence in...
We consider the positions of occurrences of a factor x and its binary
co...
We study the properties of the uncountable set of Stewart words. These a...
Given a right-infinite word x over a finite alphabet A, the rank of
x is...
We consider avoiding mesosomes – that is, words of the form xx' with x'
...
We describe Hilbert's spacefilling curve in several different ways: as a...
The Frobenius number g(S) of a set S of non-negative integers with 1 is ...
We show that the first-order theory of Sturmian words over Presburger
ar...
Given a finite alphabet Σ and a right-infinite word w over
Σ, we define ...
We show that it is decidable, given an automatic sequence s and a
consta...
We present a general method for computing the abelian complexity ρ^
ab_ ...
Recently Dekking conjectured the form of the subword complexity function...
We investigate the size of the largest entry (in absolute value) in the
...
In 1996, Neville Robbins proved the amazing fact that the coefficient of...
We re-examine previous constructions of infinite binary words containing...
An overlap-free (or β-free) word w over a fixed alphabet Σ is
extremal i...
Let α = (1+√(5))/2 and define the lower and upper Wythoff
sequences by a...
We prove an inequality for the number of periods in a word x in terms of...
A picture frame in two dimensions is a rectangular array of symbols, wit...
In this paper we consider a number of natural decision problems involvin...
Following Stolarsky, we say that a natural number n is flimsy in base b ...
We generalize Axel Thue's familiar definition of overlaps in words, and ...
Fici et al. defined a word to be a k-power if it is the concatenation of...
In 2013, Fici and Zamboni proved a number of theorems about finite and
i...
In 2005, Rampersad and the second author proved a number of theorems abo...
We show that the number of length-n words over a k-letter alphabet havin...
We start by considering binary words containing the minimum possible num...
Using a new approach based on automatic sequences, logic, and a decision...
We consider a certain natural generalization of de Bruijn words, and use...
In a recent paper of Rampersad et al., the authors conjectured that the
...
We prove various results about the largest exponent of a repetition in a...
We consider two natural problems about nondeterministic finite automata....
A rollercoaster is a sequence of real numbers for which every maximal
co...
We begin a systematic study of the relations between subword complexity ...