Logical equivalence between generalized urn models and finite automata
  To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well. 
Karl Svozil