11716 search results - page 319 / 2344 » Computable symbolic dynamics |
162
click to vote
ATVA
2005
Springer
16 years 8 days ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
161
click to vote
CIE
2005
Springer
16 years 8 days ago
2005
Springer
1 and 2, and in the last Section 4 of this abstract I will outline very briefly some conclusions about recursion and complexity which I believe that they support. 1 Partial Algebr...
152
click to vote
CP
2004
Springer
16 years 3 days ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...
176
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We present decidability results for the verification of cryptographic protocols in the presence of equational theories corresponding to xor and Abelian groups. Since the perfect ...
173
click to vote
LICS
2003
IEEE
15 years 12 months ago
2003
IEEE
We show that the first-order theory of structural subtyping of non-recursive types is decidable, as a consequence of a more general result on the decidability of term powers of d...