pith. sign in

Logical equivalence between generalized urn models and finite automata

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

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

fields

quant-ph 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.