305 search results - page 25 / 61 » Decidability of Split Equivalence |
DAM
2006
13 years 7 months ago
2006
There are many randomized "divide and conquer" algorithms, such as randomized Quicksort, whose operation involves partitioning a problem of size n uniformly at random int...
AAECC
1998
Springer
13 years 7 months ago
1998
Springer
We describe a new approach of the generalized Bezout identity for linear time-varying ordinary differential control systems. We also explain when and how it can be extended to line...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
RP
2010
Springer
13 years 5 months ago
2010
Springer
We adapt hypergraph rewriting system to a generalization of Vector Addition Systems with States (VASS) that we call vector addition systems with pairs (VASP). We give rewriting sys...