Logical equivalence between generalized urn models and finite automata
arXiv:quant-ph/0209136 · doi:10.1007/s10773-005-7052-0
Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
9 pages, minor changes