Logical equivalence between generalized urn models and finite automata

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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

Keywords

Quantum Physics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/100077

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/quant-ph/0209136
 http://arxiv.org/abs/quant-ph/0209136
 International Journal of Theoretical Physics 44(7), 745-754 (2005)
 doi:10.1007/s10773-005-7052-0

Collections

arXiv