Models of deterministic systems

The definition of “model of a system” in terms of a homomorphism of the states of the system is evaluated and an alternative definition in terms of sequence generators is proposed. Sequence generators are finite graphs whose points represent complete states of a system. Sequence generators include finite automata and other information processing systems as special cases. It is shown how to define models in terms of a projection operator which applies to any sequence generator which has an output projection and yields a new sequence generator. A model produced by the projection operator is embedded in the system it models. The notion of embedding is discussed informally and some questions raised about the relations of deterministic, indeterministic, and probabilistic models and systems.
Keywords No keywords specified (fix it)
Categories No categories specified
(categorize this paper)
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index Translate to english
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 15,822
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

4 ( #404,706 of 1,724,742 )

Recent downloads (6 months)

1 ( #349,121 of 1,724,742 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.