Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have