12 search results - page 1 / 3 » Unranked Tree Automata with Sibling Equalities and Disequali... |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
FSTTCS
2009
Springer
13 years 11 months ago
2009
Springer
ABSTRACT. We continue the study of bottom-up unranked tree automata with equality and disequality constraints between direct subtrees. In particular, we show that the emptiness pro...
LICS
2010
IEEE
13 years 3 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...
DLT
2008
13 years 6 months ago
2008
A tree automaton with global tree equality and disequality constraints, TAGED for short, is an automaton on trees which allows to test (dis)equalities between subtrees which may be...
ICDT
2010
ACM
14 years 2 months ago
2010
ACM
We consider a fragment of XPath named `forward-XPath', which contains all descendant and rightwards sibling axes as well as data equality and inequality tests. The satisfiabi...