263 search results - page 31 / 53 » Rigid Tree Automata |
CADE
2005
Springer
14 years 8 months ago
2005
Springer
We prove that, if the initial knowledge of the intruder is given by a deterministic bottom-up tree automaton, then the insecurity problem for cryptographic protocols with atomic ke...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
CA
1999
IEEE
14 years 3 hour ago
1999
IEEE
We present a simple method for performing real-time collision detection in a virtual surgery environment. The method relies on the graphics hardware for testing the interpenetrati...
RTA
2000
Springer
13 years 11 months ago
2000
Springer
Parallelism constraints are logical descriptions of trees. Parallelism constraints subsume dominance constraints and are equal in expressive power to context unification. Paralleli...
LICS
1997
IEEE
13 years 11 months ago
1997
IEEE
Fixpoint expressions built from functional signatures interpreted over arbitrary complete lattices are considered. A generic notionof automatonis defined and shown, by means of a ...