research

Logical equivalence between generalized urn models and finite automata

Authors
Publication date
1 January 2005
Publisher
'Springer Science and Business Media LLC'
Doi
    View on arXiv

    Abstract

    To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.Comment: 9 pages, minor change

      Similar works

      Full text

      thumbnail-image

      Available Versions

      Crossref

      redirect
      Last time updated on 01/04/2019