An extension of data automata that captures XPath
From MaRDI portal
Publication:2881071
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.
Recommendations
Cited in
(11)- Alternating automata on data trees and XPath satisfiability
- scientific article; zbMATH DE number 7407777 (Why is no real title available?)
- The factorisation forest theorem
- On regular paths with counting and data tests
- Nondeterministic and co-nondeterministic implies deterministic, for data languages
- An automaton over data words that captures EMSO logic
- Hilbert-style axiomatization for hybrid XPath with data
- A Note on C² Interpreted over Finite Data-Words
- On temporal logics with data variable quantifications: decidability and complexity
- First order Büchi automata and their application to verification of LTL specifications
- On notions of regularity for data languages
This page was built for publication: An extension of data automata that captures XPath
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2881071)