An extension of data automata that captures XPath
Miko{\l}aj Boja\'nczyk (University of Warsaw), S{\l}awomir Lasota, (University of Warsaw)
TL;DR
This paper introduces an extended automata model capable of recognizing properties of data words and trees, effectively capturing all Regular XPath queries and aiding in decidability and expressibility analysis.
Contribution
It proposes a new automata framework that extends data automata to encompass Regular XPath, bridging automata theory and XPath query analysis.
Findings
Automata capture all Regular XPath queries
Automata-theoretic approach aids in decidability analysis
Framework extends data automata to data words and trees
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.