Deviations from uniformity in random strings

DOI10.1007/BF00348756zbMath0638.68058MaRDI QIDQ1099625

Peter Kirschenhofer, Philippe Flajolet, Robert F. Tichy

Publication date: 1988

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

zbMATH Keywords

generating functionnormal numbersdiscrepancyrandom infinite strings

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Discrete mathematics in relation to computer science (68R99)

Related Items (13)

On the richness of the collection of subtrees in random binary search trees ⋮ A note on randomness ⋮ Threshold limits for cover times ⋮ On effective computation of expectations in large or infinite dimension ⋮ Multiple pattern matching: a Markov chain approach ⋮ Block-distribution in random strings ⋮ Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern ⋮ Unnamed Item ⋮ On the number of words containing the factor \((aba)^k\) ⋮ Consistency of the BIC order estimator ⋮ The consistency of the BIC Markov order estimator. ⋮ Motif statistics. ⋮ An application of Shoenfield's absoluteness theorem to the theory of uniform distribution

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some distribution properties of 0,1-sequences
• String overlaps, pattern matching, and nontransitive games
• Periods in strings
• Maximal Prefix-Synchronized Codes

This page was built for publication: Deviations from uniformity in random strings