Logical equivalence between generalized urn models and finite automata

DOI10.1007/s10773-005-7052-0zbMath1104.81033arXivquant-ph/0209136OpenAlexW3105897744WikidataQ58620651 ScholiaQ58620651MaRDI QIDQ2505958

Karl Svozil

Publication date: 28 September 2006

Published in: International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0209136

zbMATH Keywords

computational complementarityautomation logicgeneralized urn models

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Quantum computation (81P68) Logic in computer science (03B70) Automata and formal grammars in connection with logical questions (03D05)

Related Items (11)

Faithful orthogonal representations of graphs from partition logics ⋮ Epistemic entanglement due to non-generating partitions of classical dynamical systems ⋮ Varieties of contextuality based on probability and structural nonembeddability ⋮ On the complete description of entangled systems. I: Exploring hidden variables and context communication cost in simulating quantum correlations ⋮ Roots and (Re)sources of Value (In)definiteness Versus Contextuality ⋮ Non-contextual chocolate balls versus value indefinite quantum cryptography ⋮ Quantum violation of the suppes-zanotti inequalities and ``contextuality ⋮ Can there be given any meaning to contextuality without incompatibility? ⋮ Computational universes ⋮ Quantum scholasticism: On quantum contexts, counterfactuals, and the absurdities of quantum omniscience ⋮ Generalized Greenberger-Horne-Zeilinger arguments from quantum logical analysis

Cites Work

• Physical versus computational complementarity. I
• Automaton logic
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Logical equivalence between generalized urn models and finite automata