2005
DOI: 10.1007/11601524_14
|View full text |Cite
|
Sign up to set email alerts
|

N-Ary Queries by Tree Automata

Abstract: 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.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

3
32
0

Year Published

2005
2005
2009
2009

Publication Types

Select...
6
1

Relationship

2
5

Authors

Journals

citations
Cited by 29 publications
(35 citation statements)
references
References 18 publications
3
32
0
Order By: Relevance
“…This result has been shown before by Neven and Van Den Bussche (2002). The simple MSO-based proof presented here stems from Niehren et al (2005) where the expressiveness of n-ary queries by unambiguous tree automata has been studied too.…”
Section: Theorem 5 a Query Is Definable In Mso Iff It Is Definable Bsupporting
confidence: 68%
“…This result has been shown before by Neven and Van Den Bussche (2002). The simple MSO-based proof presented here stems from Niehren et al (2005) where the expressiveness of n-ary queries by unambiguous tree automata has been studied too.…”
Section: Theorem 5 a Query Is Definable In Mso Iff It Is Definable Bsupporting
confidence: 68%
“…[11]). Remark also that our rewrite approach can be extended to any n-ary query of XP(/,//,[ ], * ); an n-ary query selects a set of n-tuples of nodes ( [16]), and is easily represented as an n-ary pattern.…”
Section: Query Evaluationmentioning
confidence: 99%
“…Note that in the context of trees, a restricted notion of variable independence has been investigated in [15] and proved to be equivalent to non-ambiguity of tree automata.…”
Section: Fig 1 a Tree Representing A Directorymentioning
confidence: 99%
“…. , x n ) on trees over Σ can be represented as a tree automaton A over the alphabet Σ × {0, 1} n [15,19,4]. Moreover, we can assume that A is canonical, i.e.…”
Section: Preliminariesmentioning
confidence: 99%
See 1 more Smart Citation