Logical equivalence between generalized urn models and finite automata

Details Logical equivalence between generalized urn models and finite automata Logical equivalence between generalized urn models and finite automata

2002-09-25

arxiv.org/abs/quant-ph/0209136v2

International Journal of Theoretical Physics 44(7), 745-754 (2005)

Physics

Quantum Physics

9 pages, minor changes

Scientific paper

10.1007/s10773-005-7052-0

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

Affiliated with

Also associated with

No associations

Rating

Logical equivalence between generalized urn models and finite automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Logical equivalence between generalized urn models and finite automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Logical equivalence between generalized urn models and finite automata will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-367084