759 search results - page 2 / 152 » Overlap-Free Regular Languages |
85
Voted
ECOOP
2003
Springer
15 years 8 months ago
2003
Springer
131
click to vote
CADE
2005
Springer
16 years 3 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...
201
Voted
POPL
2001
ACM
16 years 3 months ago
2001
ACM
118
Voted
PODS
2010
ACM
15 years 7 months ago
2010
ACM
XML Schema Definitions (XSDs) can be adequately abstracted by the single-type regular tree languages. It is wellknown, that these form a strict subclass of the robust class of re...
84
Voted
ICFP
2000
ACM
15 years 7 months ago
2000
ACM
