Uniformly balanced words with linear complexity and prescribed letter frequencies

Details Uniformly balanced words with linear complexity and prescribed letter frequencies Uniformly balanced words with linear complexity and prescribed letter frequencies

2011-08-18

arxiv.org/abs/1108.3620v1

EPTCS 63, 2011, pp. 44-52

Computer Science

Formal Languages and Automata Theory

In Proceedings WORDS 2011, arXiv:1108.3412

Scientific paper

10.4204/EPTCS.63.8

We consider the following problem. Let us fix a finite alphabet A; for any given d-uple of letter frequencies, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by the given d-uple. This paper investigates a construction method for such words based on the use of mixed multidimensional continued fraction algorithms.

Affiliated with

Also associated with

No associations

Rating

Uniformly balanced words with linear complexity and prescribed letter frequencies 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 Uniformly balanced words with linear complexity and prescribed letter frequencies, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Uniformly balanced words with linear complexity and prescribed letter frequencies will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-180569