2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/100077To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.9 pages, minor changesQuantum PhysicsLogical equivalence between generalized urn models and finite automatatext