Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Björklund, H., & Bojańczyk, M. (2007). Bounded depth data trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4596 LNCS, pp. 862–874). Springer Verlag. https://doi.org/10.1007/978-3-540-73420-8_74
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
