Decidable classes of documents for XPath

DOI10.4230/LIPICS.FSTTCS.2012.99MaRDI QIDQ2957484zbMATH OpenFDO

Authors Vince Bárány, Mikołaj Bojańczyk, Diego Figueira, Paweł Parys

Publication date 26 January 2017

zbMATH Keywords

XMLsatisfiabilitydata treesdata wordsXPathclass automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Database theory (68P15) Decidability of theories and sets of sentences (03B25) Logic in computer science (03B70)

Recommendations

• Decidability of downward XPath
• XPath satisfiability in the presence of DTDs
• Database Programming Languages
• Alternating automata on data trees and XPath satisfiability
• Complexity of Data Tree Patterns over XML Documents

Cited in

(1)

• XPath satisfiability in the presence of DTDs

This page was built for publication: Decidable classes of documents for XPath

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2957484)