732 search results - page 118 / 147 » Axiomatising timed automata |
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
PODS
2004
ACM
14 years 7 months ago
2004
ACM
Typechecking consists of statically verifying whether the output of an XML transformation is always conform to an output type for documents satisfying a given input type. We focus...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We examine decision problems for various classes of convex languages, previously studied by Ang and Brzozowski under the name “continuous languages”. We can decide whether a la...
LATA
2009
Springer
14 years 2 months ago
2009
Springer
We propose an algorithm that given as input a full word w of length n, and positive integers p and d, outputs (if any exists) a maximal p-periodic partial word contained in w with ...
LICS
2009
IEEE
14 years 2 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...