Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps

研究成果: Contribution to conferencePaper査読

抄録

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.

本文言語英語
ページ709-720
ページ数12
出版ステータス出版済み - 2009
外部発表はい
イベント21st International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'09 - Linz, オーストリア
継続期間: 7 20 20097 24 2009

その他

その他21st International Conference on Formal Power Series and Algebraic Combinatorics, FPSAC'09
国/地域オーストリア
CityLinz
Period7/20/097/24/09

All Science Journal Classification (ASJC) codes

  • 代数と数論

フィンガープリント

「Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル