2005 | OriginalPaper | Chapter
N-Ary Queries by Tree Automata
Authors : Joachim Niehren, Laurent Planque, Jean-Marc Talbot, Sophie Tison
Published in: Database Programming Languages
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.