Example: air traffic controller
Problems in Markov chains - ku
The theory for these processes can be handled within the theory for Markov chains by the following con-struction: Let Yn = ... urn and replacing it with c+1 marbles of the same colour, c ∈ N. Define the stochastic process {Xn}n≥1 by Xn = (1 if the n’th marble drawn is black
Download Problems in Markov chains - ku
Information
Domain:
Source:
Link to this page: