Bounded Depth Data Trees

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.

• Type: Conference
• Year: 2007
• Where: ICALP
• Authors: Henrik Björklund, Mikolaj Bojanczyk
• Keywords: Appropriate Automaton Model, Data Trees, Decidable Emptiness Problems, ICALP 2007, Theoretical Computer Science