Finite trace semantics is known and well understood for classical automata and non-deterministic labelled transition systems. Jacobs et al introduced a more general definition fo...
This paper addresses the problem of revising a Dung-style argumentation framework by adding finitely many new arguments which may interact with old ones. We study the behavior of t...
For birth and death processes with finite state space consisting of N + 1 points (N 2), we consider stochastic processes induced by conditioning on hitting the right boundary poi...
In arbitrary dimension, we consider the semi-discrete elliptic operator -2 t + AM , where AM is a finite difference approximation of the operator - x((x) x). For this operator we d...
Abstract--The quantum-dot cellular automata (QCA) model offers a novel nano-domain computing architecture by mapping the intended logic onto the lowest energy configuration of a co...