Logical equivalence between generalized urn models and finite automata
Quantum Physics
2007-05-23 v2
Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
Cite
@article{arxiv.quant-ph/0209136,
title = {Logical equivalence between generalized urn models and finite automata},
author = {Karl Svozil},
journal= {arXiv preprint arXiv:quant-ph/0209136},
year = {2007}
}
Comments
9 pages, minor changes