Conjunctive Visibly-Pushdown Path Queries

DOI10.1007/978-3-319-22177-9_25zbMath1436.68085OpenAlexW2244538531MaRDI QIDQ2947891

Martin Lange, Etienne Lozes

Publication date: 29 September 2015

Published in: Fundamentals of Computation Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-22177-9_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Data structures (68P05)

Related Items (2)

Unnamed Item ⋮ Local higher-order fixpoint iteration

Cites Work

• Expressiveness and static analysis of extended conjunctive regular path queries
• Conjunctive-query containment and constraint satisfaction
• Graph Logics with Rational Relations
• Deciding Equivalence of Finite Tree Automata
• Visibly pushdown languages
• Unnamed Item
• Unnamed Item

This page was built for publication: Conjunctive Visibly-Pushdown Path Queries