|Abstract||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)|
No categories specified
(categorize this paper)
|Through your library||Only published papers are available at libraries|
Similar books and articles
Charlotte Werndl (2009). Are Deterministic Descriptions and Indeterministic Descriptions Observationally Equivalent? Studies in History and Philosophy of Science Part B 40 (3):232-242.
Ludomir Newelski (1999). Flat Morley Sequences. Journal of Symbolic Logic 64 (3):1261-1279.
Axel Cleeremans & L. JimC)nez (1998). Implicit Sequence Learning: The Truth is in the Details. In Michael A. Stadler & Peter A. Frensch (eds.), Handbook of Implicit Learning. Newbury Park, CA: Sage.
Rainer Kerth (1998). The Interpretation of Unsolvable Λ-Terms in Models of Untyped Λ-Calculus. Journal of Symbolic Logic 63 (4):1529-1548.
Tim Fernando (1999). A Modal Logic for Non-Deterministic Discourse Processing. Journal of Logic, Language and Information 8 (4):445-468.
Rajeev Goré (1994). Cut-Free Sequent and Tableau Systems for Propositional Diodorean Modal Logics. Studia Logica 53 (3):433 - 457.
Added to index2010-07-21
Total downloads4 ( #188,906 of 722,870 )
Recent downloads (6 months)1 ( #60,917 of 722,870 )
How can I increase my downloads?