Some algorithms on the star operation applied to finite languages.
Let . Motivated by a conjecture of Erdös, Lau developed a new method and proved that We consider arithmetical functions whose summation can be expressed as , where is a polynomial, and . We generalize Lau’s method and prove results about the number of sign changes for these error terms.
Page 1