331 search results - page 2 / 67 » When are Two Rewrite Systems More than None |
SYNASC
2005
IEEE
13 years 10 months ago
2005
IEEE
We improve, by using register machines, some existing universality results for specific models of P systems. P systems with membrane creation are known to generate all recursivel...
OPODIS
2008
13 years 6 months ago
2008
In this paper, we study the atomic multicast problem, a fundamental abstraction for building faulttolerant systems. In the atomic multicast problem, the system is divided into non...
ALP
1994
Springer
13 years 9 months ago
1994
Springer
Kennaway proved the remarkable result that every (almost) orthogonal term rewriting system admits a computable sequential normalizing reduction strategy. In this paper we present ...
CHI
2003
ACM
14 years 5 months ago
2003
ACM
We conducted a questionnaire-based study of the relative importance of two factors, inquirer and situation, in determining the preferred accuracy of personal information disclosed...
FOSSACS
2001
Springer
13 years 9 months ago
2001
Springer
In a recent paper we introduced a new framework for the study of call by need computations. Using elementary tree automata techniques and ground tree transducers we obtained simple...