The subword complexity of smooth words on 2-letter alphabets

Details The subword complexity of smooth words on 2-letter alphabets The subword complexity of smooth words on 2-letter alphabets

2010-12-15

arxiv.org/abs/1012.3229v1

Theoret. Comput. Sci., 412 (2011) ,6327-6339

Mathematics

Combinatorics

20 Pages

Scientific paper

Let $\gamma_{a,b}(n)$ be the number of smooth words of length $n$ over the alphabet $\{a,b\}$ with $a

Affiliated with

Also associated with

No associations

Rating

The subword complexity of smooth words on 2-letter alphabets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The subword complexity of smooth words on 2-letter alphabets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The subword complexity of smooth words on 2-letter alphabets will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-13316