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...
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
Concurrent Time-stamp Systems (ctss) allow processes to temporally order concurrent events in an asynchronous shared memorysystem, a powerful tool for concurrency control, serving...
This report outlines the use of a relational representation in a Multi-Agent domain to model the behaviour of the whole system. A desired property in this systems is the ability of...
Embedded application requirements, including high performance, low power consumption and fast time to market, are uncommon in the broader domain of general purpose applications. I...