The complexity of smooth words on 2-letter alphabets

  • Authors:

  • Yun Bao Huang

  • Affiliations:

  • -

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2011

Quantified Score

Hi-index 5.23

Visualization

Abstract

Let @c"a","b(n) be the number of smooth words of length n over the alphabet {a,b} with a