34 search results - page 3 / 7 » The Power of Nondeterminism in Self-Assembly |
FUIN
2007
14 years 9 months ago
2007
Devices of interconnected parallel acting sequential automata are investigated from a language theoretic point of view. Starting with the well-known result that each unary language...
92
Voted
IJFCS
2007
14 years 9 months ago
2007
We characterize the computational power of several restricted variants of communicating P systems. We show that 2-deterministic communicating P systems with 2 membranes, working in...
172
Voted
CP
2009
Springer
15 years 10 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
96
Voted
ATVA
2011
Springer
13 years 9 months ago
2011
Springer
Abstract. In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between dis...
110
Voted
EPEW
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Restricting the power of the schedulers that resolve the nondeterminism in probabilistic concurrent systems has recently drawn the attention of the research community. Th...