759 search results - page 2 / 152 » Overlap-Free Regular Languages |
ECOOP
2003
Springer
13 years 11 months ago
2003
Springer
CADE
2005
Springer
14 years 6 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...
POPL
2001
ACM
14 years 6 months ago
2001
ACM
PODS
2010
ACM
13 years 11 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...
ICFP
2000
ACM
13 years 10 months ago
2000
ACM
