240 search results - page 27 / 48 » Infinite trace equivalence |
IWANN
2001
Springer
14 years 1 months ago
2001
Springer
In the beginning of nineties, Hava Siegelmann proposed a new computational model, the Artificial Recurrent Neural Network (ARNN), and proved that it could perform hypercomputation....
APAL
2010
13 years 8 months ago
2010
Let C() denote the class of all cardinal sequences of length associated with compact scattered spaces. Also put C() = {f C() : f(0) = = min[f() : < ]}. If is a cardinal an...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We generalize some of the central results in automata theory to the abstraction level of coalgebras and thus lay out the foundations of a universal theory of automata ope...
JALC
2006
13 years 8 months ago
2006
In this paper we present an extension of Dolev-Yao models for security protocols with a notion of random polynomial-time (Las Vegas) computability. First we notice that Dolev-Yao ...
JAPLL
2006
13 years 8 months ago
2006
A conjecture by D. Seese states that if a set of graphs has a decidable monadic second-order theory, then it is the image of a set of trees under a transformation defined by monad...