scientific article; zbMATH DE number 7561597
From MaRDI portal
Publication:5091266
DOI10.4230/LIPIcs.ICALP.2019.104MaRDI QIDQ5091266
Pablo Barceló, Miguel Romero, Diego Figueira
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.00850
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (3)
Fine-Grained Complexity of Regular Path Queries ⋮ Foundations of graph path query languages. Course notes for the reasoning web summer school 2021 ⋮ Formal languages in information extraction and graph databases
Cites Work
- Unnamed Item
- Unnamed Item
- Rewriting of regular expressions and regular path queries
- Limitedness theorem on finite automata with distance functions: An algebraic proof
- Handbook of weighted automata
- Limitedness theorem on finite automata with distance functions
- Data independent recursion in deductive databases
- From bidirectionality to alternation.
- The limitedness problem on distance automata: Hashiguchi's method revisited
- Regular queries on graph databases
- Decidability Results for the Boundedness Problem
- Weak Cost Monadic Logic over Infinite Trees
- Undecidable optimization problems for database logic programs
- Semantic Acyclicity on Graph Databases
- Evaluation and Enumeration Problems for Regular Path Queries
- The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem
- The Theory of Stabilisation Monoids and Regular Cost Functions
- Two-way cost automata and cost logics over infinite trees
- The Complexity of Boundedness for Guarded Logics
- A Step Up in Expressiveness of Decidable Fixpoint Logics
- State-complexity of finite-state devices, state compressibility and incompressibility
This page was built for publication:
