84 search results - page 11 / 17 » The Computational Power of Benenson Automata |
DNA
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. A very common approach in chemistry and biology is to observe the progress of an experiment, and take the result of this observation as the final output. Inspired by thi...
RTA
2005
Springer
15 years 3 months ago
2005
Springer
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
ACRI
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Network decontamination (or disinfection) is a widely studied problem in distributed computing. Network sites are assumed to be contaminated (e.g., by a virus) and a team...
100
click to vote
LPAR
2005
Springer
15 years 3 months ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
FCT
1999
Springer
15 years 1 months ago
1999
Springer
Abstract. An iterative array is a line of interconnected interacting finite automata. One distinguished automaton, the communication cell, is connected to the outside world and fe...