pith. sign in

arxiv: quant-ph/0209136 · v2 · submitted 2002-09-25 · 🪐 quant-ph

Logical equivalence between generalized urn models and finite automata

Karl Svozil This is my paper
classification 🪐 quant-ph
keywords finitegeneralizedautomataautomatoncalculusconverseequivalenceevery
0
0 comments X
read the original abstract

To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Structures as Generative Scores: Partition Logic, Generative Logic, and Aesthetic Form

    quant-ph 2026-03 unverdicted novelty 5.0

    Partition logic is converted into Prolog generative grammars to produce modular artifacts like the Quantum Square, keeping logical structure independent of its realization for design and communication uses.