N-Ary Queries by Tree Automata [chapter]

Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
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