On the asymptotics of the number of binary words with a given length of a maximal series

DOI10.1016/S0166-218X(00)00369-3zbMath1003.05009OpenAlexW2021486398MaRDI QIDQ5954091

Aleksej Dmitrievich Korshunov

Publication date: 15 October 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(00)00369-3

zbMATH Keywords

asymptotic expressionsbinary wordssymbol sequence

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Cites Work

• Two moments suffice for Poisson approximations: The Chen-Stein method
• Longest runs in a sequence of \(m\)-dependent random variables
• On the field of combinatory analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the asymptotics of the number of binary words with a given length of a maximal series