We have developed a general denition of segregation in the context of Z system specications. This denition is general enough to allow multi-way communications between otherwise seg...
Abstract. In this paper, we first briefly survey automated termination proof methods for higher-order calculi. We then concentrate on the higher-order recursive path ordering, for ...
Abstract. There are many examples of intelligent and learning systems that are based either on the connectionist or the symbolic approach. Although the latter can be successfully c...
Abstract. We study the effect of randomness in the adversarial queueing model. All proofs of instability for deterministic queueing strategies exploit a finespun strategy of insert...
Abstract. Since recognizable tree languages are closed under the rational operations, every regular tree expression denotes a recognizable tree language. We provide an alternative ...