Finite-state methods are applied to the Russell-Wiener notion of time (based on events) and developed into an account of interval relations and temporal propositions. Strings are formed and collected in regular languages and regular relations that are argued to embody temporal relations in their various underspecified guises. The regular relations include retractions that reduce computations by projecting strings down to an appropriate level of granularity, and non-deterministic relations defining notions of partiality within and across such levels
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Observing Events and Situations in Time.Tim Fernando - 2007 - Linguistics and Philosophy 30 (5):527-550.
Constructing Situations and Time.Tim Fernando - 2011 - Journal of Philosophical Logic 40 (3):371 - 396.
Dynamic Algebras: Examples, Constructions, Applications.Vaughan Pratt - 1991 - Studia Logica 50 (3-4):571 - 605.
Finite State Automata and Simple Recurrent Networks.Axel Cleeremans & David Servan-Schreiber - unknown
A Faithful Embedding of Parallel Computations in Star-Finite Models.E. J. Farkas - 1988 - Studia Logica 47 (3):203 - 212.
Added to index2012-03-02
Total downloads248 ( #13,881 of 2,164,579 )
Recent downloads (6 months)1 ( #347,995 of 2,164,579 )
How can I increase my downloads?