Logical equivalence between generalized urn models and finite automata
英文摘要：
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
