An extension of data automata that captures XPath
Logic in Computer Science
2015-07-01 v2 Formal Languages and Automata Theory
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.
Keywords
Cite
@article{arxiv.1201.0597,
title = {An extension of data automata that captures XPath},
author = {Mikołaj Bojańczyk and Sławomir Lasota},
journal= {arXiv preprint arXiv:1201.0597},
year = {2015}
}