A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
N-Ary Queries by Tree Automata
[chapter]
2005
Lecture Notes in Computer Science
We investigate n-ary node selection queries in trees by successful runs of tree automata. We show that run-based n-ary queries capture MSO, contribute algorithms for enumerating answers of n-ary queries, and study the complexity of the problem. We investigate the subclass of run-based n-ary queries by unambiguous tree automata.
doi:10.1007/11601524_14
fatcat:et24hmhegncwhanlsg2byydnha