Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$

Details Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$ Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$

2010-11-19

arxiv.org/abs/1011.4438v1

Computer Science

Formal Languages and Automata Theory

25 pages

Scientific paper

Brlek et al. (2008) studied smooth infinite words and established some results on letter frequency, recurrence, reversal and complementation for 2-letter alphabets having same parity. In this paper, we explore smooth infinite words over $n$-letter alphabet $\{a_1,a_2,...,a_n\}$, where $a_10 \text{ and }n$ is an even number, the generalized Kolakoski words are uniformly recurrent for the alphabet $\Sigma_n$ with the cyclic order; (4) the factor set of three times differentiable infinite words is not closed under any nonidentical permutation. Brlek et al.'s results are only the special cases of our corresponding results.

Affiliated with

Also associated with

No associations

Rating

Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$ 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 Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Smooth infinite words over $n$-letter alphabets having same remainder when divided by $n$ will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-117478