Cover Image

MSO-Enumeration Over SLP-Compressed Unranked Forests

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lohrey, Markus, Schmid, Markus L.
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory Databases
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)

On the complexity of computing Strahler numbers
by: Ganardi, Moses, et al.
Published: (2025)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

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

Regular Languages in the Sliding Window Model
by: Ganardi, Moses, et al.
Published: (2024)

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

Computing measures of weak-MSO definable sets of trees
by: Niwiński, Damian, et al.
Published: (2024)

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

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

Designing and Comparing RPQ Semantics
by: Marsault, Victor, et al.
Published: (2026)

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

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

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

On Normality and Equidistribution for Separator Enumerators
by: Pulari, Subin
Published: (2026)

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

A Factorization Theorem for Forest Algebras
by: Almagor, Shaull, et al.
Published: (2026)

Linear Time Subsequence and Supersequence Regex Matching
by: Amarilli, Antoine, et al.
Published: (2025)

The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)

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

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

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

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)

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)

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

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

Deconstructing Subset Construction -- Reducing While Determinizing
by: Nicol, John, et al.
Published: (2025)

Multihead Finite-State Compression
by: Lutz, Neil
Published: (2025)

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

Reversible Pebble Transducers
by: Dartois, Luc, et al.
Published: (2025)

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

Active Learning of Symbolic Automata Over Rational Numbers
by: Hagedorn, Sebastian, et al.
Published: (2025)

Automatic Abelian Complexities of Parikh-Collinear Fixed Points
by: Rigo, Michel, et al.
Published: (2024)

Finite Automata for Efficient Graph Recognition
by: Drewes, Frank, et al.
Published: (2024)

MITL Model Checking via Generalized Timed Automata and a New Liveness Algorithm
by: Akshay, S., et al.
Published: (2024)

A Formal Approach for Tuning Stochastic Oscillators
by: Ballarini, Paolo, et al.
Published: (2024)