15 citations · 107 across the 77 of their papers we have counts for
5 papers · 1 filter
The periodic complexity function of the Thue-Morse word, the Rudin-Shapiro word, and the period-doubling word
Narad Rampersad
We revisit the periodic complexity function introduced by Mignosi and Restivo. This function gives the average of the first local periods of a recurrent infinite…
Prefixes of the Fibonacci word that end with a cube
Narad Rampersad
We study the prefixes of the Fibonacci word that end with a cube. Using Walnut we obtain an exact description of the positions of the Fibonacci word at which a cube ends.
Extending Dekking's construction of an infinite binary word avoiding abelian -powers
James Currie, Lucas Mol, Narad Rampersad +1
We construct an infinite binary word with critical exponent 3 that avoids abelian 4-powers. Our method gives an algorithm to determine if certain types of morphic sequences avoid a…
Congruence properties of combinatorial sequences via Walnut and the Rowland-Yassawi-Zeilberger automaton
Narad Rampersad, Jeffrey Shallit
Certain famous combinatorial sequences, such as the Catalan numbers and the Motzkin numbers, when taken modulo a prime power, can be computed by finite automata. Many theorems abou…
Closed Ziv-Lempel factorization of the -bonacci words
Marieh Jahannia, Morteza Mohammad-noori, Narad Rampersad +1
A word is said to be closed if it has a proper factor which occurs exactly twice in , as a prefix and as a suffix of . Based on the concept of Ziv-Lempel factorizatio…