54 search results - page 6 / 11 » Deterministic Automata on Unranked Trees |
FSTTCS
2006
Springer
15 years 3 months ago
2006
Springer
We observe that pushdown tree automata (PTAs) known in the literature cannot express combinations of branching and pushdown properties. This is because a PTA processes the children...
LICS
2005
IEEE
15 years 5 months ago
2005
IEEE
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
107
click to vote
LICS
2010
IEEE
14 years 10 months ago
2010
IEEE
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
101
click to vote
PODS
2010
ACM
15 years 4 months ago
2010
ACM
A generalization from string to trees and from languages to translations is given of the classical result that any regular language can be learned from examples: it is shown that ...
WIA
2007
Springer
15 years 6 months ago
2007
Springer
