Graduate studies at Western
|Abstract||A sequence generator is a finite graph, more general than, but akin to, the usual state diagram associated with a finite automaton. The nodes of a sequence generator represent complete states, and each node is labeled with an input and an output state. An element of the behavior of a sequence generator is obtained by taking the input and output states along an infinite path of the graph.Sequence generators may be associated with formulas of the monadic predicate calculus, in which the individual variables range over the times 0, 1, 2, 3, [middle dot][middle dot][middle dot], and the predicate variables represent complete states, input states, and output states. An unrestricted singulary recursion is a formula in which the complete state at time [tau] + 1 is expressed as a truth-function of the complete state at time [tau] and the input states from times [tau] + 1 to [tau] + h. Necessary and sufficient conditions are given for a formula derived from a sequence generator being equivalent to an unrestricted singulary recursion.|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Tim Fernando (1999). A Modal Logic for Non-Deterministic Discourse Processing. Journal of Logic, Language and Information 8 (4):445-468.
Stellan Ohlsson (1997). Old Ideas, New Mistakes: All Learning is Relational. Behavioral and Brain Sciences 20 (1):79-80.
Paul Benacerraf (1996). Recantation or Any Old W-Sequence Would Do After All. Philosophia Mathematica 4 (2):184-189.
David Makinson & Leendert van der Torre (2001). Constraints for Input/Output Logics. Journal of Philosophical Logic 30 (2):155-185.
Ludomir Newelski (1999). Flat Morley Sequences. Journal of Symbolic Logic 64 (3):1261-1279.
Added to index2010-07-21
Total downloads3 ( #213,976 of 739,189 )
Recent downloads (6 months)2 ( #37,337 of 739,189 )
How can I increase my downloads?