Logical Equivalence Between Generalized Urn Models and Finite Automata
Karl Svozil, Karl Svozil · 2002
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well. KEY WORDS: computational complementarity; automation logic; generalized urn models.