Application of Smirnov words to waiting time distributions of runs

zbMath1369.05006arXiv1503.08096MaRDI QIDQ2401440

Clemens Heuberger, Prodinger, Helmut, Uta Renata Freiberg

Publication date: 8 September 2017

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1503.08096

zbMATH Keywords

generating functionwaiting time distributionrunSmirnov word

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Permutations, words, matrices (05A05) Graph theory (including graph drawing) in computer science (68R10) Combinatorial probability (60C05) Stopping times; optimal stopping problems; gambling theory (60G40)

Related Items (1)

Unnamed Item

Cites Work

• Birthday paradox, coupon collectors, caching algorithms and self- organizing search
• Automata in SageMath---Combinatorics meet Theoretical Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Application of Smirnov words to waiting time distributions of runs