Editing Finite-state machine (section)

=== Finite Markov chain processes ===
::"We may think of a [[Markov chain]] as a process that moves successively through a set of states ''s<sub>1</sub>'', ''s<sub>2</sub>'', …, ''s<sub>r</sub>''. … if it is in state ''s<sub>i</sub>'' it moves on to the next stop to state ''s<sub>j</sub>'' with probability ''p<sub>ij</sub>''. These probabilities can be exhibited in the form of a transition matrix" (Kemeny (1959), p. 384)
Finite Markov-chain processes are also known as [[subshifts of finite type]].

* {{cite book | last = Booth| first = Taylor L. | title = Sequential Machines and Automata Theory | edition = 1st | publisher = John Wiley and Sons, Inc. | location = New York | year = 1967| id = Library of Congress Card Catalog Number 67-25924}}
* {{cite book | last1 = Kemeny| first1 = John G. |first2=Hazleton |last2=Mirkil |first3=J. Laurie |last3=Snell |first4=Gerald L. |last4=Thompson | title = Finite Mathematical Structures| url = https://archive.org/details/finitemathematic0000keme_h5g0| url-access = registration| edition = 1st | publisher = Prentice-Hall, Inc. | location = Englewood Cliffs, N.J. | year = 1959| id = Library of Congress Card Catalog Number 59-12841}} Chapter 6 "Finite Markov Chains".