On Generating Functions of Waiting Time Problems for Sequence Patterns of Discrete Random Variables

Masayuki Uchida

Annals of the Institute of Statistical Mathematics, 1998, vol. 50, issue 4, 655-671

Keywords: Sequence patterns; runs; sooner and later problems; r-th occurrence problem; discrete distribution of order k; generalized probability generating function; higher order Markov chain (search for similar items in EconPapers)
Date: 1998
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://hdl.handle.net/10.1023/A:1003756712643 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aistmt:v:50:y:1998:i:4:p:655-671

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10463/PS2

DOI: 10.1023/A:1003756712643

Access Statistics for this article

Annals of the Institute of Statistical Mathematics is currently edited by Tomoyuki Higuchi

More articles in Annals of the Institute of Statistical Mathematics from Springer, The Institute of Statistical Mathematics
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().