Logical Equivalence Between Generalized Urn Models and Finite Automata
Login
University Home
→
Library
JavaScript is disabled for your browser. Some features of this site may not work without it.
Logical Equivalence Between Generalized Urn Models and Finite Automata
Svozil, K
Identifier:
http://hdl.handle.net/2292/3687
Issue Date:
2002-02
Reference:
CDMTCS Research Reports CDMTCS-179 (2002)
Rights:
The author(s)
Rights (URI):
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm
Abstract:
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
Show full item record
Files in this item
Name:
179karl.pdf
Size:
55.41Kb
Format:
PDF
Related URL:
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial
This item appears in the following Collection(s)
CDMTCS Research Reports (1995+)
[574]
Share
Search ResearchSpace
Search ResearchSpace
This Collection
Browse
All of ResearchSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
This Collection
By Issue Date
Authors
Titles
Subjects
Statistics
View Usage Statistics