Article
Licensed
Unlicensed
Requires Authentication
Covering runs in binary Markov sequences
-
L. Ya. Savelyev
Published/Copyright:
June 1, 2003
We describe distributions of the lengths of initial, covering, and final runs in binary Markov sequences. For the means and variances, we give exact and asymptotic formulas. We also give the generating functions. We observe that in Markov sequences the probabilities of run lengths do not necessarily decrease as the lengths grow, and hence, the corresponding distributions may be of quite complex form. We investigate conditions under which, due to the Markov property, the probabilities increase as the run lengths do. We consider operator equations which include final runs.
Published Online: 2003-06-01
Published in Print: 2003-06-01
Copyright 2003, Walter de Gruyter
You are currently not able to access this content.
You are currently not able to access this content.
Articles in the same Issue
- Covering runs in binary Markov sequences
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- On the complexity of recurring sequences
- Limit theorems for the number of points of a given set covered by a random linear subspace
- On a Sprindzhuk problem
- On the activity of cell circuits realising the system of all conjunctions
Articles in the same Issue
- Covering runs in binary Markov sequences
- An optimal in order method of synthesis of a search operator in the class of automaton circuits of a special form
- On the complexity of recurring sequences
- Limit theorems for the number of points of a given set covered by a random linear subspace
- On a Sprindzhuk problem
- On the activity of cell circuits realising the system of all conjunctions
