500 search results - page 65 / 100 » Universality and Cellular Automata |
ICWS
2007
IEEE
13 years 11 months ago
2007
IEEE
We study the problem of synthesis of a choreogrpher in Web service composition for a given set of services and a goal. Services and goal are represented using i/o automata which c...
ICALP
2007
Springer
14 years 4 months ago
2007
Springer
d Abstract) Marcin Jurdzi´nski and Ashutosh Trivedi Department of Computer Science, University of Warwick, UK In a reachability-time game, players Min and Max choose moves so that...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
ECAL
2007
Springer
14 years 4 months ago
2007
Springer
We introduce the concept of neutral emergence (defined by analogy to an information theoretic view of neutral evolution), and discuss how it might be used in the engineering of ro...
DNA
2004
Springer
14 years 3 months ago
2004
Springer
We propose a new way to implement (general) computing devices with unbounded memory. In particular, we show a procedure to implement automata with unbounded stack memory, push-down...