An extension of data automata that captures XPathArticle
Authors: Mikołaj Bojańczyk ; Sławomir Lasota
NULL##0000-0001-8674-4470
Mikołaj Bojańczyk;Sławomir Lasota
We define a new kind of automata recognizing properties of data words or data
trees and prove that the automata capture all queries definable in Regular
XPath. We show that the automata-theoretic approach may be applied to answer
decidability and expressibility questions for XPath.
Bartosz Bednarczyk;Piotr Witkowski, International Symposium on Temporal Representation and Reasoning, A Note on C² Interpreted over Finite Data-Words, pp. 14-, 2020, 10.4230/lipics.time.2020.17.
Taolue Chen;Fu Song;Zhilin Wu, Lecture notes in computer science, Formal Reasoning on Infinite Data Values: An Ongoing Quest, pp. 195-257, 2017, 10.1007/978-3-319-56841-6_6.
Fu Song;Zhilin Wu, 2016, On temporal logics with data variable quantifications: Decidability and complexity, Information and Computation, 251, pp. 104-139, 10.1016/j.ic.2016.08.002.
Orna Grumberg;Orna Kupferman;Sarai Sheinvald, Lecture notes in computer science, An Automata-Theoretic Approach to Reasoning about Parameterized Systems and Specifications, pp. 397-411, 2013, 10.1007/978-3-319-02444-8_28.