9 search results - page 2 / 2 » On the Decidability of the Equivalence for k-Valued Transduc... |
FOIKS
2008
Springer
13 years 7 months ago
2008
Springer
Visibly Pushdown Languages (VPLs), recognized by Visibly Pushdown Automata (VPAs), are a nicely behaved family of contextfree languages. It has been shown that VPAs are equivalent ...
STOC
2010
ACM
14 years 3 months ago
2010
ACM
We close affirmatively a question which has been open for long time: decidability of the HOM problem. The HOM problem consists in determining, given a tree homomorphism D and a re...
DBPL
1999
Springer
13 years 10 months ago
1999
Springer
Abstract. Based on the recursion mechanism of the XML transformation language XSL, the document transformation language DTL is defined. First the instantiation DTLreg is considere...
FOIKS
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We give a general framework for approximate query processing in semistructured databases. We focus on regular path queries, which are the integral part of most of the que...