Cover Image

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Muñoz, Martín
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Databases Formal Languages and Automata Theory Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)

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

A Myhill-Nerode Theorem for Generalized Automata, with Applications to Pattern Matching and Compression
by: Cotumaccio, Nicola
Published: (2023)

Data Structures for Finite Downsets of Natural Vectors: Theory and Practice
by: Cadilhac, Michaël, et al.
Published: (2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
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)

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

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

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

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

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

Fine-Grained Complexity of Regular Path Queries
by: Casel, Katrin, et al.
Published: (2021)

The Existential Theory of the Reals as a Complexity Class: A Compendium
by: Schaefer, Marcus, et al.
Published: (2024)

Dynamic Membership for Regular Tree Languages
by: Amarilli, Antoine, et al.
Published: (2025)

Spectral and combinatorial methods for efficiently computing the rank of unambiguous finite automata
by: Kiefer, Stefan, et al.
Published: (2025)

Attractors Is All You Need: Parity Games In Polynomial Time
by: van der Heijden, Rick
Published: (2025)

From Width-Based Model Checking to Width-Based Automated Theorem Proving
by: Oliveira, Mateus de Oliveira, et al.
Published: (2022)

Constant-Time Dynamic Enumeration of Word Infixes in a Regular Language
by: Amarilli, Antoine, et al.
Published: (2026)

Effective MSO-Definability for Tree-width Bounded Models of an Inductive Separation Logic of Relations
by: Bueri, Lucas, et al.
Published: (2024)

The NFA Acceptance Hypothesis: Non-Combinatorial and Dynamic Lower Bounds
by: Bringmann, Karl, et al.
Published: (2023)

Deciding Reachability and the Covering Problem with Diagnostics for Sound Acyclic Free-Choice Workflow Nets
by: Prinz, Thomas M., et al.
Published: (2026)

Wheeler Bisimulations
by: Cotumaccio, Nicola
Published: (2026)

The Inverse Lyndon Array: Definition, Properties, and Linear-Time Construction
by: Negri, Pietro, et al.
Published: (2026)

Out-of-Order Membership in Regular Languages
by: Amarilli, Antoine, et al.
Published: (2026)

A closer look at TDFA
by: Borsotti, Angelo, et al.
Published: (2022)

Maximal Closed Substrings
by: Badkobeh, Golnaz, et al.
Published: (2022)

Novel Results on the Number of Runs of the Burrows-Wheeler-Transform
by: Giuliani, Sara, et al.
Published: (2020)

A Fast Algorithm for Computing Prefix Probabilities
by: Nowak, Franz, et al.
Published: (2023)

Generating a Gray code for prefix normal words in amortized polylogarithmic time per word
by: Burcsi, Péter, et al.
Published: (2020)

Computing Minimal Absent Words and Extended Bispecial Factors with CDAWG Space
by: Inenaga, Shunsuke, et al.
Published: (2024)

Absent Subsequences in Words
by: Kosche, Maria, et al.
Published: (2021)

Exponent-Strings and Their Edit Distance
by: Baek, Ingyu
Published: (2024)

Subsequences in Bounded Ranges: Matching and Analysis Problems
by: Kosche, Maria, et al.
Published: (2022)

Indexing Finite-State Automata Using Forward-Stable Partitions
by: Becker, Ruben, et al.
Published: (2024)

Efficient Matching of Some Fundamental Regular Expressions with Backreferences
by: Nogami, Taisei, et al.
Published: (2025)

$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)

Algorithmical Aspects of Some Bio Inspired Operations
by: Dumitran, Marius
Published: (2025)

On Minimizers of Minimum Density
by: Shur, Arseny
Published: (2025)

Prefix Trees Improve Memory Consumption in Large-Scale Continuous-Time Stochastic Models
by: Taylor, Landon, et al.
Published: (2025)