Waiting time distributions for pattern occurrence in a constrained sequence - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Discrete Mathematics and Theoretical Computer Science Année : 2007

Waiting time distributions for pattern occurrence in a constrained sequence

Résumé

A binary sequence of zeros and ones is called a (d; k)-sequence if it does not contain runs of zeros of length either lessthan d or greater than k, where d and k are arbitrary, but fixed, non-negative integers and d < k. Such sequences find requires that (d; k)-sequences do not contain a specific pattern w. Therefore, distribution results concerning pattern occurrence in (d; k)-sequences are of interest. In this paper we study the distribution of the waiting time until the r-th occurrence of a pattern w in a random (d; k)-sequence generated by a Markov source. Numerical examples are also provided.
Fichier principal
Vignette du fichier
635-2651-2-PB.pdf (184.56 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00966498 , version 1 (26-03-2014)

Identifiants

Citer

Valeri T. Stefanov, Wojciech Szpankowski. Waiting time distributions for pattern occurrence in a constrained sequence. Discrete Mathematics and Theoretical Computer Science, 2007, Vol. 9 no. 1 (1), pp.305--320. ⟨10.46298/dmtcs.382⟩. ⟨hal-00966498⟩

Collections

TDS-MACS
69 Consultations
848 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More