One type of them is called a Kripke Structure, and is extended with fairness constraints.
One type of them is called a Kripke Structure, and is extended with fairness constraints. They are also shown to be equivalent to a Turing machine that can only read right to left. A Markov chain is also a type of one with probabilities assigned to each transition. More common types include one that produces an output during each step, called Mealy, and the Moore variety, which produces an output after each step. Used to understand computation, this is, FTP, what kind of pattern matching theoretical construct?
One type of them is called a Kripke Structure, and is extended with fairness constraints.
{finite state} machine or finite state {automaton}