1 citations · 3 across the 13 of their papers we have counts for
5 papers · 2 filters
An upper bound of the number of distinct powers in binary words
Shuo Li
A power is a word of the form , where is a word and is a positive integer and a square is a word of the form . Fraenkel and Sim…
A note on the Lie complexity and beyond
Shuo Li
In a recent paper, Jason P. Bell and Jeffrey Shallit introduced the notion of {\em Lie complexity} and proved that the Lie complexity function of an automatic sequence is automatic…
A note on the maximum number of -powers in a finite word
Shuo Li, Jakub Pachocki, Jakub Radoszewski
A \emph{power} is a word of the form , where is a word and is a positive integer; the power is also called a {\em -power} and $k…
On the number of squares in a finite word
Srečko Brlek, Shuo Li
A {\em square} is a word of the form . In this paper we prove that for a given finite word , the number of distinct square factors of is bounded by $|w|-|\Alphabet(w)|+1…
On the number of -powers in a finite word
Shuo Li
This note is an attempt to attack a conjecture of Fraenkel and Simpson stated in 1998 concerning the number of distinct squares in a finite word. By counting the number of (right-)…