We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
In this paper, we present a term rewriting based library for manipulating Java bytecode. We define a mapping from bytecode programs to algebraic terms, and we use Tom, an extensi...
Emilie Balland, Pierre-Etienne Moreau, Antoine Rei...
This paper extends the termination proof techniques based on reduction orderings to a higher-order setting, by defining a family of recursive path orderings for terms of a typed ...
Background: One important application of microarray experiments is to identify differentially expressed genes. Often, small and negative expression levels were clipped-off to be e...
Most of the existing literature on cooperative relay networks has focused on frequency– nonselective channels or frequency–selective channels with multi–carrier transmission...