Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps
Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009).

Voir la notice de l'article provenant de la source Episciences

In this article, we investigate the asymptotic occurrence rates of specific subwords in any infinite binary word. We prove that the asymptotic occurrence rate for the subwords is upper- and lower-bounded in the same way for every infinite binary word, in terms of the asymptotic occurrence rate of the zeros. We also show that both of the bounds are best-possible by constructing, for each bound, a concrete infinite binary word such that the bound is reached. Moreover, we apply the result to analyses of recently-proposed pseudorandom number generators that are based on integer-valued variants of logistic maps.
@article{DMTCS_2009_special_256_a18,
     author = {Nuida, Koji},
     title = {Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)},
     year = {2009},
     doi = {10.46298/dmtcs.2696},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2696/}
}
TY  - JOUR
AU  - Nuida, Koji
TI  - Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps
JO  - Discrete mathematics & theoretical computer science
PY  - 2009
VL  - DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2696/
DO  - 10.46298/dmtcs.2696
LA  - en
ID  - DMTCS_2009_special_256_a18
ER  - 
%0 Journal Article
%A Nuida, Koji
%T Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps
%J Discrete mathematics & theoretical computer science
%D 2009
%V DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2696/
%R 10.46298/dmtcs.2696
%G en
%F DMTCS_2009_special_256_a18
Nuida, Koji. Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps. Discrete mathematics & theoretical computer science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009) (2009). doi : 10.46298/dmtcs.2696. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2696/

Cité par Sources :