In this paper we introduce the well distributed occurrences (WDO) combinatorial property for infinite words, which guarantees good behavior (no lattice structure) in some related pseudorandom number generators. An infinite word u on a d-ary alphabet has the WDO property if, for each factor w of u, positive integer m, and vector v, there is an occurrence of w such that the Parikh vector of the prefix of u preceding such occurrence is congruent to v modulo m. We prove that Sturmian words, and more generally Arnoux-Rauzy words and some morphic images of them, have the WDO property. © 2013 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Balková, Ĺ., Bucci, M., De Luca, A., & Puzynina, S. (2013). Infinite words with well distributed occurrences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8079 LNCS, pp. 46–57). Springer Verlag. https://doi.org/10.1007/978-3-642-40579-2_8
Mendeley helps you to discover research relevant for your work.