Bounded Depth Data Trees

  title={Bounded Depth Data Trees},
  author={Henrik Bj{\"o}rklund and Mikolaj Bojanczyk},
A data tree is a tree where each node has a label from a finite set, and a data value from a possibly infinite set. We consider data trees whose depth is bounded beforehand. By developing an appropriate automaton model, we show that under this assumption various formalisms, including a two variable first-order logic and a subset of XPath, have decidable emptiness problems. 
Highly Cited
This paper has 21 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-10 of 33 references

Static analysis of XML transformation and schema

  • W. Martens
  • PhD Thesis, Hasselt University,
  • 2006

Static analysis of XML transformation and schema languages

  • W. Martens
  • 2006

Similar Papers

Loading similar papers…