Valérie Berthé (CNRS- Univ. Paris 7) |
Sébastien Labbé (LACIM-UQAM) |

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. |

Published: 17th August 2011.

ArXived at: http://dx.doi.org/10.4204/EPTCS.63.8 | bibtex |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |