Abstract
Overlap free words over two letters are called irreducible binary words. Let d( n) denote the number of irreducible binary words of length n. In this paper we show that there are positive constants C 1 and C 2 such that C 1 n 1.155< d( n)< C 2 n 1.587 holds for all n>0.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have