Theoretical Computer Science
Pushdown machines for the macro tree transducer
Theoretical Computer Science
Acta Cybernetica
A formal model for an expressive fragment of XSLT
Information Systems - Databases: Creation, management and utilization
Monadic Second Order Logic and Node Relations on Graphs and Trees
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Jewels are Forever, Contributions on Theoretical Computer Science in Honor of Arto Salomaa
Typechecking for XML transformers
Journal of Computer and System Sciences - Special issue on PODS 2000
Information Processing Letters
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML type checking with macro tree transducers
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
LICS '05 Proceedings of the 20th Annual IEEE Symposium on Logic in Computer Science
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
The expressivity of XPath with transitive closure
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the tree-transformation power of XSLT
Acta Informatica
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Automata- and logic-based pattern languages for tree-structured data
Proceedings of the 2nd international conference on Semantics in databases
The design space of type checkers for XML transformation languages
ICDT'05 Proceedings of the 10th international conference on Database Theory
Expressive power of pebble automata
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
XPath, transitive closure logic, and nested tree walking automata
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Language and Automata Theory and Applications
Type inference and type checking for queries on execution traces
Proceedings of the VLDB Endowment
Transitive closure logic, nested tree walking automata, and XPath
Journal of the ACM (JACM)
Weighted tree-walking automata
Acta Cybernetica
Finding your way in a forest: on different types of trees and their properties
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
Type inference and type checking for queries over execution traces
The VLDB Journal — The International Journal on Very Large Data Bases
Foundations of XML based on logic and automata: a snapshot
FoIKS'12 Proceedings of the 7th international conference on Foundations of Information and Knowledge Systems
Parameter reduction and automata evaluation for grammar-compressed trees
Journal of Computer and System Sciences
Weighted specifications over nested words
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
| Hi-index | 0.00 |
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" ones). The resulting pebble tree automata recognize the regular tree languages (i.e., can validate all generalized DTD's) and hence can find all matches of MSO definable n-ary patterns. Moreover, when viewed as a navigational device, they lead to an XPath-like formalism that has a path expression for every MSO definable binary pattern. The resulting pebbletree transducers can apply arbitrary MSO definable tests to (the observable part of) their configurations, they (still) have a decidable typechecking problem, and they can model the recursion mechanism of XSLT. The time complexity ofthe typechecking problem for conjunctive queries that use MSO definable binary patterns can often be reduced through the use of invisible pebbles.