dorsal/arxiv
View SchemaLogical equivalence between generalized urn models and finite automata
| Authors | Karl Svozil |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0209136 |
| URL | https://arxiv.org/abs/quant-ph/0209136 |
| DOI | 10.1007/s10773-005-7052-0 |
| Journal | International Journal of Theoretical Physics 44(7), 745-754 (2005) |
Abstract
To every generalized urn model there exists a finite (Mealy) automaton with identical propositional calculus. The converse is true as well.
{
"annotation_id": "460a6170-420d-4d2a-b275-bac37e1ef136",
"date_created": "2026-03-02T18:01:52.989000Z",
"date_modified": "2026-03-02T18:01:52.989000Z",
"file_hash": "c0e2affc91f45fa4558e8081495ea3ebf4bedb00a05ba6940769a021d8fa0f58",
"private": false,
"record": {
"abstract": "To every generalized urn model there exists a finite (Mealy) automaton with\nidentical propositional calculus. The converse is true as well.",
"arxiv_id": "quant-ph/0209136",
"authors": [
"Karl Svozil"
],
"categories": [
"quant-ph"
],
"doi": "10.1007/s10773-005-7052-0",
"journal_ref": "International Journal of Theoretical Physics 44(7), 745-754 (2005)",
"title": "Logical equivalence between generalized urn models and finite automata",
"url": "https://arxiv.org/abs/quant-ph/0209136"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "9f71b10b-cffd-40e6-be95-b862cb5413af",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}