On the representation of finite multiple Markov chains by weighted circuits (Q1106555)

Circuit processes of any finite order are defined using a finite class of weighted circuits in a finite set. Their study was initiated by \textit{J. MacQueen} [Ann. Probab. 9, 604-610 (1981; Zbl 0464.60070)]. In the present paper, the author fully clarifies MacQueen's treatment by noticing the importance of time reversal in delimiting the class of Markov chains of order r which can be represented as circuit processes of that order.