Logical equivalence between generalized urn models and finite automata

Simple item page
dc.creatorSvozil, Karl
dc.date2002-09-25
dc.date2005-12-20
dc.date.accessioned2026-07-07T06:36:26Z
dc.date.available2026-07-07T06:36:26Z
dc.descriptionTo every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
dc.description9 pages, minor changes
dc.identifierhttps://arxiv.org/abs/quant-ph/0209136
dc.identifierhttp://arxiv.org/abs/quant-ph/0209136
dc.identifierInternational Journal of Theoretical Physics 44(7), 745-754 (2005)
dc.identifierdoi:10.1007/s10773-005-7052-0
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/100077
dc.subjectQuantum Physics
dc.titleLogical equivalence between generalized urn models and finite automata
dc.typetext

Files

Collections

arXiv