Logical equivalence between generalized urn models and finite automata
Svozil, Karl
Original · EN
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.