84 search results - page 12 / 17 » The Computational Power of Benenson Automata |
178
click to vote
IEEESCC
2005
IEEE
15 years 11 months ago
2005
IEEE
eal world”, represented abstractly using (time-varying) first-order logic predicates and terms. A representative composition result [11] here uses a translation into Petri nets. ...
145
click to vote
COCOON
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. We investigate the computing power of stateless multicounter machines with reversal-bounded counters. Such a machine can be deterministic, nondeterministic, realtime (the...
177
click to vote
ESOP
2008
Springer
15 years 7 months ago
2008
Springer
Abstract. We survey recent developments in an approach to the verification of higher-order computation based on game semantics. Higherorder recursion schemes are in essence (progra...
150
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We explore the computational power of networks of small resource-limited mobile agents. We define two new models of computation based on pairwise interactions of finite-state ag...
193
click to vote
STACS
1991
Springer
15 years 9 months ago
1991
Springer
Formal power series over non-commuting variables have been investigated as representations of the behavior of automata with multiplicities. Here we introduce and investigate the co...