16 citations · 16 across the 4 of their papers we have counts for
1 paper · 1 filter
Blake Madill, Narad Rampersad
We show that the abelian complexity function of the ordinary paperfolding word is a 2-regular sequence.