Abstract. Stochastic deterministic finite automata have been introduced and are used in a variety of settings. We report here a number of results concerning the learnability of th...
The question raised in [15] is answered how to naturally dely used forms of recursion by abstract machines. We show that turbo ASMs as defined in [7] allow one to faithfully refl...
Abstract. The hiding of internal invariants creates a mismatch between procedure specifications in an interface and proof obligations on the implementations of those procedures. T...
Abstract. A special kind of anticipation is when an anticipated undesired situation makes an agent adapt its behavior in order to prevent that this situation will occur. In this ch...
Abstract-- This paper considers when a discrete-time periodic non-homogeneous system can be transformed to a time-invariant one by using regular linear mappings of state variables,...