Cover Image

Designing and Comparing RPQ Semantics

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Marsault, Victor, Meyer, Antoine
Format:	Preprint
Published:	2026
Subjects:	Databases Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Matching walks that are minimal with respect to edge inclusion
by: Marsault, Victor
Published: (2024)

Distinct Shortest Walk Enumeration for RPQs
by: David, Claire, et al.
Published: (2023)

Skyline Operators for Document Spanners
by: Amarilli, Antoine, et al.
Published: (2023)

The Complexity of Aggregates over Extractions by Regular Expressions
by: Doleschal, Johannes, et al.
Published: (2020)

A framework for extraction and transformation of documents
by: Riveros, Cristian, et al.
Published: (2024)

A Unifying Perspective on Succinct Data Representations
by: Kimelfeld, Benny, et al.
Published: (2023)

MSO-Enumeration Over SLP-Compressed Unranked Forests
by: Lohrey, Markus, et al.
Published: (2024)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)

A Circus of Circuits: Connections Between Decision Diagrams, Circuits, and Automata
by: Amarilli, Antoine, et al.
Published: (2024)

Refl-Spanners: A Purely Regular Approach to Non-Regular Core Spanners
by: Schmid, Markus L., et al.
Published: (2020)

Locality and Centrality: The Variety ZG
by: Amarilli, Antoine, et al.
Published: (2021)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

Locality Testing for NFAs is PSPACE-complete
by: Amarilli, Antoine, et al.
Published: (2025)

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, et al.
Published: (2026)

Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)

Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
by: García, Julián, et al.
Published: (2025)

Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)

FC-Datalog as a Framework for Efficient String Querying
by: Bell, Owen M., et al.
Published: (2025)

A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)

Revisiting Weighted Information Extraction: A Simpler and Faster Algorithm for Ranked Enumeration
by: Gawrychowski, Pawel, et al.
Published: (2024)

Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)

On the Complexity of Language Membership for Probabilistic Words
by: Amarilli, Antoine, et al.
Published: (2025)

Digital Circuits as Moore Machines
by: Yodaiken, Victor
Published: (2010)

Standard Automata Theory and Process Algebra
by: Yodaiken, Victor
Published: (2022)

Networks of Moore Machines
by: Yodaiken, Victor
Published: (2015)

Well-Behaved (Co)algebraic Semantics of Regular Expressions in Dafny
by: Zetzsche, Stefan, et al.
Published: (2024)

TEMPORA: Efficient Verification of Metric Temporal Properties with Past in Pointwise Semantics
by: Akshay, S., et al.
Published: (2025)

Separability and Non-Determinizability of WSTS
by: Czerwiński, Wojciech, et al.
Published: (2023)

Improving Unstructured Data Quality via Updatable Extracted Views
by: Kassaie, Besat, et al.
Published: (2025)

CIR+CVN: Bridging LLM Semantic Understanding and Petri-Net Verification for Concurrent Programs
by: Zhang, Kaiwen, et al.
Published: (2026)

Comparing Spoken Languages using Paninian System of Sounds and Finite State Machines
by: Prabhu, Shreekanth M, et al.
Published: (2023)

From Trees to Tree-Like: Distribution and Synthesis for Asynchronous Automata
by: Lehaut, Mathieu, et al.
Published: (2026)

One-clock synthesis problems
by: Lasota, Sławomir, et al.
Published: (2026)

Infinite-state Games with Energy Objectives Beyond Counters
by: Sağlam, Irmak, et al.
Published: (2026)

Nondeterministic state complexity of square root
by: Onishchenko, Sergey
Published: (2026)

Forgetting Event Order in Higher-Dimensional Automata
by: Zouari, Safa
Published: (2026)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
by: Chen, Zeyu, et al.
Published: (2026)

Exact Accepting-State Spectrum for Reversal of Permutation Automata
by: German, Samuel
Published: (2026)

Temporal Causal Models as a Model of Computation
by: Gladyshev, Maksim, et al.
Published: (2026)