305 search results - page 6 / 61 » Decidability of Split Equivalence |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. This paper solves the unambiguity and the sequentiality problem for polynomially ambiguous min-plus automata. This result is proved through a decidable algebraic characte...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We consider security properties of cryptographic protocols that can be modeled using the notion of trace equivalence. The notion of equivalence is crucial when specifying privacy-...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We prove that observational equivalence of IA3 + Y0 (3rdorder Idealized Algol with 0th-order recursion) is equivalent to the DPDA Equivalence Problem, and hence decidable...
IJCV
2011
12 years 11 months ago
2011
We examine the underlying structure of popular algorithms for variational methods used in image processing. We focus here on operator splittings and Bregman methods based on a uniï...
APAL
2000
13 years 7 months ago
2000
In this paper we study elementary submodels of a stable homogeneous structure. We improve the independence relation defined in [Hy]. We apply this to prove a structure theorem. We...