Smooth words on 2-letter alphabets having same parity

  • Authors:

  • S. Brlek;D. Jamet;G. Paquin

  • Affiliations:

  • LaCIM, Université du Québec à Montréal, C.P. 8888 Succursale Centre-Ville, Montréal (QC), Canada H3C 3P8;LORIA - Campus Scientifique - BP 239, 54506, Vandoeuvre-lès-Nancy Cedex, France;LaCIM, Université du Québec à Montréal, C.P. 8888 Succursale Centre-Ville, Montréal (QC), Canada H3C 3P8

  • Venue:
  • Theoretical Computer Science
  • Year:
  • 2008

Quantified Score

Hi-index 5.23

Visualization

Abstract

In this paper, we consider smooth words over 2-letter alphabets {a,b}, where a,b are integers having same parity, with 0