✦ LIBER ✦

The complexity of smooth words on 2-letter alphabets

✍ Scribed by Yun Bao Huang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Smooth words on 2-letter alphabets havin

✍ S. Brlek; D. Jamet; G. Paquin 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 422 KB

On the number of partially abelian squar

✍ Robert Cori; Maria Rosaria Formisano 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 706 KB

On the centers of the set of weakly squa

✍ Arturo Carpi 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 313 KB

On the computational complexity of infin

✍ Pavol Ďuriš; Ján Maňuch 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 132 KB

On the number of Dejean words over alpha

✍ Roman Kolpakov; Michaël Rao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 260 KB

On the asymptotic abelian complexity of

✍ Blanchet-Sadri, F.; Fox, Nathan; Rampersad, Narad 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 622 KB