15 citations · 107 across the 77 of their papers we have counts for
23 papers · 1 filter
An example of an automatic sequence with non-regular abelian complexity
Jean-Paul Allouche, Narad Rampersad, Michel Rigo +2
Answering a question of Madill and Rampersad, we give an example a of a -automatic sequence whose abelian complexity is not -regular.
Complexity of Linear Subsequences of Fibonacci-Automatic Sequences
Delaram Moradi, Narad Rampersad, Jeffrey Shallit
We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of stat…
Complexity of Linear Subsequences of -Automatic Sequences
Delaram Moradi, Narad Rampersad, Jeffrey Shallit
We construct automata with input(s) in base recognizing some basic relations and study their number of states. We also consider some basic operations on -automatic sequences…
Repetition factorization of automatic sequences
Jeffrey Shallit, Xinhao Xu
Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repe…
The Lexicographically Least Binary Rich Word Achieving the Repetition Threshold
James Currie, Narad Rampersad
We find the lexicographically least infinite binary rich word having critical exponent
New results on pseudosquare avoidance
Tim Ng, Pascal Ochem, Narad Rampersad +1
We start by considering binary words containing the minimum possible numbers of squares and antisquares (where an antisquare is a word of the form ), and we complet…