Pseudorandom number generators based on infinite words.

MaRDI QIDQ2936749zbMATH OpenFDO

Authors Jiří Hladký, L'ubomira Balková

Publication date 6 January 2015

Full work available at URL http://hdl.handle.net/10338.dmlcz/144026

zbMATH Keywords

pseudorandom number generatorlattice structurewell-distributed occurrences

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Combinatorics on words (68R15)

Recommendations

• Aperiodic pseudorandom number generators based on infinite words
• Infinite words with well distributed occurrences
• Testing randomness via aperiodic words
• Finite and infinite pseudorandom binary words
• An aperiodic pseudorandom number generator

Cited in

(5)

• Testing randomness via aperiodic words
• Aperiodic pseudorandom number generators based on infinite words
• Bounds of asymptotic occurrence rates of some patterns in binary words related to integer-valued logistic maps
• Pattern occurrence in the dyadic expansion of square root of two and an analysis of pseudorandom number generators
• Infinite words with well distributed occurrences

This page was built for publication: Pseudorandom number generators based on infinite words.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936749)