How homogeneous can the last appearing pattern be?

DOI10.1002/RSA.3240040104MaRDI QIDQ4034708zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Can large inhomogeneities generate target patterns?
• scientific article; zbMATH DE number 1943766
• scientific article; zbMATH DE number 806876

Cites work

• scientific article; zbMATH DE number 4007323 (Why is no real title available?)
• scientific article; zbMATH DE number 4078366 (Why is no real title available?)
• More on the Waiting Time Till Each of Some Given Patterns Occurs as a Run
• On the waiting time till each of some given patterns occurs as a run

Cited in

(1)

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

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

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