Computational Rules for Binary Word Frequencies of Occurrence
In this chapter it is assumed that each of the pattern records is time stationary and that a record after sampling and coding constitutes “an adequately long” binary sequence. By “adequately long” is understood a length that permits the computation of each of the interesting binary word frequencies to take place with the desired computational accuracy.
KeywordsBinary Sequence Adequate Length Finite Probability Binary Word Pattern Record
Unable to display preview. Download preview PDF.