A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
A machine can manufacture any one of n Markov chains P$ (1 < y < n); the P$ are defined on the space of all sequences x = (x(m)} (1 < m < oo) and are absolutely continuous (in finite times) with respect to one another. It is assumed that chains P%> evolve in a random way, dictated by a Markov chain 9(m) with n states, so that when 0(m) =j the machine is producing Pp. One observes the o-fields of x(m) in order to determine when to inspect 0(m). With each product P$ there is associated a cost e,.doi:10.1090/s0002-9947-1978-0515530-4 fatcat:uiwcotyisfhehnm4u5vluevb4e