Uniformly balanced words with linear complexity and prescribed letter frequencies
Formal Languages and Automata Theory
2011-08-19 v1 Discrete Mathematics
Abstract
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.
Keywords
Cite
@article{arxiv.1108.3620,
title = {Uniformly balanced words with linear complexity and prescribed letter frequencies},
author = {Valérie Berthé and Sébastien Labbé},
journal= {arXiv preprint arXiv:1108.3620},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412