An extension of data automata that captures XPath

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.

Cited by in corpus (2)

• Logics with rigidly guarded data tests
• Model Checking Parse Trees