234 search results - page 30 / 47 » On Quasi-Products of Tree Automata |
XIMEP
2004
ACM
15 years 6 months ago
2004
ACM
We argue that efficient support for schema validation and type annotation in XQuery processors deserves as much attention as efficient evaluation techniques for XPath queries have...
105
click to vote
FSTTCS
2001
Springer
15 years 5 months ago
2001
Springer
Given a binary relation IE ∪ IR on the set of ground terms e signature, we define an abstract rewrite closure for IE ∪ IR. act rewrite closure can be interpreted as a speciali...
102
click to vote
PODS
2007
ACM
16 years 1 months ago
2007
ACM
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
111
click to vote
ICALP
2010
Springer
15 years 6 months ago
2010
Springer
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
FORTE
2004
15 years 2 months ago
2004
Witnesses and counterexamples produced by model checkers provide a very useful source of diagnostic information. They are usually returned in the form of a single computation path ...