RESEARCH ARTICLE
On Limited Length Binary Strings with an Application in Statistical Control
F.S. Makri1, *, Z.M. Psillakis2
Article Information
Identifiers and Pagination:
Year: 2017Volume: 8
First Page: 1
Last Page: 6
Publisher Id: TOSPJ-8-1
DOI: 10.2174/1876527001708010001
Article History:
Received Date: 04/08/2016Revision Received Date: 01/09/2016
Acceptance Date: 12/09/2016
Electronic publication date: 28/02/2017
Collection year: 2017
© 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.
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.
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.
