15 citations · 107 across the 77 of their papers we have counts for
92 papers
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.
Subword enumeration up to stack-sorting equivalence
John M. Campbell, Narad Rampersad
Defant and Kravitz introduced generalizations of West's stack-sorting map from permutations to finite words. This raises questions as to how such generalizations could be appli…
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…
Reduced complexities for sequences over finite alphabets
John M. Campbell, James Currie, Narad Rampersad
Letting denote a finite, nonempty word, let denote the word obtained from by replacing every subword of of the form for a given charac…
Low complexity binary words avoiding -powers
James Currie, Narad Rampersad
Rote words are infinite words that contain factors of length for every . Shallit and Shur, as well as Ollinger and Shallit, showed that there are Rote words that…