85 search results - page 4 / 17 » Decidability of Trajectory-Based Equations |
JUCS
2010
13 years 4 months ago
2010
: A language L is the orthogonal concatenation of languages L1 and L2 if every word of L can be written in a unique way as a concatenation of a word in L1 and a word in L2. The not...
CADE
2006
Springer
14 years 6 months ago
2006
Springer
This paper presents new classes of tree automata combining automata with equality test and automata modulo equational theories. We believe that these classes have a good potential ...
ENTCS
2002
13 years 6 months ago
2002
If S = 0 is a system of n equations and unknowns over C and S() = 0 to what extent can we compute with the point ? In particular, can we decide whether or not a polynomial express...
CADE
2009
Springer
14 years 6 months ago
2009
Springer
In the symbolic analysis of security protocols, two classical notions of knowledge, deducibility and indistinguishability, yield corresponding decision problems. We propose a proce...
FSTTCS
2003
Springer
13 years 11 months ago
2003
Springer
For monoids that satisfy a weak cancellation condition, it is shown that the decidability of the existential theory of word equations is preserved under graph products. Furthermore...