How homogeneous can the last appearing pattern be?

DOI10.1002/RSA.3240040104zbMath0788.60019OpenAlexW2040741411MaRDI QIDQ4034708

Tamás F. Móri

Publication date: 16 May 1993

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.3240040104

zbMATH Keywords

homogeneityuniformly distributed random letters

Mathematics Subject Classification ID

Combinatorial probability (60C05)

Related Items (1)

Cover times for words in symmetric and nonsymmetric cases: A comparison

Cites Work

• Unnamed Item
• Unnamed Item
• On the waiting time till each of some given patterns occurs as a run
• More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run

This page was built for publication: How homogeneous can the last appearing pattern be?