首页   按字顺浏览 期刊浏览 卷期浏览 How homogeneous can the last appearing pattern be?
How homogeneous can the last appearing pattern be?

 

作者: Tamás F. Móri,  

 

期刊: Random Structures&Algorithms  （WILEY Available online 1993）
卷期: Volume 4, issue 1  

页码: 59-70

 

ISSN:1042-9832

 

年代: 1993

 

DOI:10.1002/rsa.3240040104

 

出版商: Wiley Subscription Services, Inc., A Wiley Company

 

数据来源: WILEY

 

摘要:

AbstractGiven a sequence of indepent, uniformly distributed random letters coming from a finite alphabet, we are interested in the word (pattern) which is the last to be observed for the first time among all words of lengthn. We derive anas. result on the homogeneity of this last appearing pattern as a corollary of a more general theorem. © 1993 John Wiley&Sons, Inc

 

点击下载:  PDF (398KB)



返 回