305 search results - page 18 / 61 » Decidability of Split Equivalence |
CSR
2006
Springer
13 years 11 months ago
2006
Springer
We show that two equivalent K-automata are conjugate to a third one, when K is equal to B, N, Z, or any (skew) field and that the same holds true for functional tranducers as well....
ICALP
1999
Springer
13 years 12 months ago
1999
Springer
We consider the problem of simulation preorder/equivalence between infinite-state processes and finite-state ones. We prove that simulation preorder (in both directions) and simu...
RTA
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We consider the problem of deciding the security of cryptographic protocols for a bounded number of sessions, taking into account some algebraic properties of the securit...
CONCUR
2004
Springer
13 years 11 months ago
2004
Springer
We introduce a generic family of behavioral relations for which the problem of comparing an arbitrary transition system to some finite-state specification can be reduced to a model...
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
We give necessary and sufficient conditions for the first-order theory of a finitely presented abelian lattice-ordered group to be decidable. We also show that if the number of gen...