305 search results - page 1 / 61 » Decidability of Split Equivalence |
IANDC
2002
13 years 4 months ago
2002
We show that the following problem is decidable: given expressions E1 and E2 constructed from variables by the regular operations and shuffle, is the identity E1 = E2 true for all...
CONCUR
2012
Springer
11 years 7 months ago
2012
Springer
Abstract. Multi-threaded programs with recursion are naturally modeled as multi-pushdown systems. The behaviors are represented as multiply nested words (MNWs), which are words enr...
CADE
2002
Springer
14 years 5 months ago
2002
Springer
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that h...
TCS
1998
13 years 4 months ago
1998
We prove that bisimulation equivalence is decidable for normed pushdown processes.
PLANX
2007
13 years 6 months ago
2007
Many useful XML transformations can be formulated through deterministic top-down tree transducers. A canonical form for such transducers is presented which allows to decide equiva...