13 search results - page 1 / 3 » Pebble Weighted Automata and Transitive Closure Logics |
ICALP
2010
Springer
13 years 9 months ago
2010
Springer
CORR
2007
Springer
13 years 4 months ago
2007
Springer
PODS
2008
ACM
14 years 4 months ago
2008
ACM
We consider the navigational core of XPath, extended with two operators: the Kleene star for taking the transitive closure of path expressions, and a subtree relativisation operat...
JACM
2010
13 years 3 months ago
2010
LICS
2009
IEEE
13 years 11 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...