Bottom-up automata on data trees and vertical XPath

A data tree is a finite tree whose every node carries a label from a finite alphabet and a datum from some infinite domain. We introduce a new model of automata over unranked data trees with a decidable emptiness problem. It is essentially a bottom-up alternating automaton with one register that can store one data value and can be used to perform equality tests with the data values occurring within the subtree of the current node. We show that it captures the expressive power of the vertical fragment of XPath - containing the child, descendant, parent and ancestor axes - obtaining thus a decision procedure for its satisfiability problem.

[1]  Alberto Marcone,et al.  Foundations of BQO theory , 1994 .

[2]  Wenfei Fan,et al.  Satisfiability of XPath Queries with Sibling Axes , 2005, DBPL.

[3]  Philippe Schnoebelen,et al.  Well-structured transition systems everywhere! , 2001, Theor. Comput. Sci..

[4]  Diego Figueira,et al.  Reasoning on words and trees with data , 2010 .

[5]  L. Dickson.  Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors , 1913 .

[6]  Thomas Schwentick,et al.  Two-variable logic on data trees and XML reasoning , 2009, JACM.

[7]  Diego Figueira,et al.  Future-Looking Logics on Data Words and Trees , 2009, MFCS.

[8]  Ursula Dresdner,et al.  Computation Finite And Infinite Machines , 2016 .

[9]  Marcin Jurdzinski,et al.  Alternation-free modal mu-calculus for data trees , 2007, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007).

[10]  Carsten Lutz,et al.  The complexity of query containment in expressive fragments of XPath 2.0 , 2007, PODS.

[11]  Diego Figueira,et al.  Forward-XPath and extended register automata on data-trees , 2010, ICDT '10.

[12]  Diego Figueira,et al.  Satisfiability of downward XPath with data equality tests , 2009, PODS.

[13]  Marcin Jurdzinski,et al.  Alternating automata on data trees and XPath satisfiability , 2008, TOCL.

[14]  Diego Figueira.  A Decidable Two-Way Logic on Data Words , 2011, 2011 IEEE 26th Annual Symposium on Logic in Computer Science.

[15]  Diego Figueira,et al.  Bottom-up automata on data trees and vertical XPath , 2011, STACS.

[16]  Michael Benedikt,et al.  XPath leashed , 2009, CSUR.

[17]  Diego Figueira,et al.  On XPath with transitive axes and data tests , 2013, PODS.

[18]  Michael Benedikt,et al.  XPath satisfiability in the presence of DTDs , 2008, JACM.

[19]  Petr Jancar.  A Note on Well Quasi-Orderings for Powersets , 1999, Inf. Process. Lett..