RESEARCH ARTICLE


On Limited Length Binary Strings with an Application in Statistical Control



F.S. Makri1, *, Z.M. Psillakis2
1 Department of Mathematics, University of Patras, 26500 Patras, Greece
2 Department of Physics, University of Patras, 26500 Patras, Greece


Article Metrics

CrossRef Citations:
0
Total Statistics:

Full-Text HTML Views: 687
Abstract HTML Views: 636
PDF Downloads: 406
ePub Downloads: 226
Total Views/Downloads: 1955
Unique Statistics:

Full-Text HTML Views: 325
Abstract HTML Views: 349
PDF Downloads: 295
ePub Downloads: 156
Total Views/Downloads: 1125



© 2017 Makri and Psillakis

open-access license: This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International Public License (CC-BY 4.0), a copy of which is available at: https://creativecommons.org/licenses/by/4.0/legalcode. This license permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

* Address correspondence to this author at the Department of Mathematics, University of Patras, 26500 Patras, Greece; Tel: 0030-2610-996738; E-mail: makri@math.upatras.gr


Abstract

In a 0 - 1 sequence of Markov dependent trials we consider a statistic which counts strings of a limited length run of 0s between subsequent 1s. Its probability mass function is used to determine the chance that a stochastic process remains or not in statistical control. Illustrative numerics are presented.

Keywords: Binary strings, runs, overlapping counting, Markov chain, Statistical control.