Expressiveness and static analysis of extended conjunctive regular path queries
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 1142294 (Why is no real title available?)
- scientific article; zbMATH DE number 2150289 (Why is no real title available?)
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Bounded Algol-Like Languages
- Elements of automata theory. Translated from the French by Reuben Thomas
- Elements of finite model theory.
- Expressiveness and static analysis of extended conjunctive regular path queries
- Extended Regular Expressions: Succinctness and Decidability
- Languages with homomorphic replacements
- On Goedel speed-up and succinctness of language representations
- THE PHENOMENON OF NON-RECURSIVE TRADE-OFFS
- Theory of computation.
Cited in
(13)- On the Complexity of Evaluating Regular Path Queries over Linear Existential Rules
- Foundations of graph path query languages. Course notes for the reasoning web summer school 2021
- Static analysis of navigational XPath over graph databases
- scientific article; zbMATH DE number 2241907 (Why is no real title available?)
- Context-free path querying by Kronecker product
- scientific article; zbMATH DE number 5808834 (Why is no real title available?)
- Path querying on acyclic graphs using Boolean grammars
- Document spanners: from expressive power to decision problems
- A logic for document spanners
- Expressiveness and static analysis of extended conjunctive regular path queries
- Deterministic regular expressions with back-references
- Fine-Grained Complexity of Regular Path Queries
- Conjunctive visibly-pushdown path queries
This page was built for publication: Expressiveness and static analysis of extended conjunctive regular path queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q389234)