A formal query language and automata model for aggregation in complex event recognition
Fuente:
arXiv
Saved in:
| Main Authors: | Bourhis, Pierre, Riveros, Cristian, Salas, Amaranta |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Complex event recognition under time constraints: towards a formal framework for efficient query evaluation
by: García, Julián, et al.
Published: (2025)
by: García, Julián, et al.
Published: (2025)
Complex event recognition meets hierarchical conjunctive queries
by: Pinto, Dante, et al.
Published: (2024)
by: Pinto, Dante, et al.
Published: (2024)
Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024)
by: Bourhis, Pierre, et al.
Published: (2024)
The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025)
by: Gallot, Paul, et al.
Published: (2025)
A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)
by: Martens, Wim, et al.
Published: (2019)
Homomorphism Problems in Graph Databases and Automatic Structures
by: Morvan, Rémi
Published: (2025)
by: Morvan, Rémi
Published: (2025)
FC-Datalog as a Framework for Efficient String Querying
by: Bell, Owen M., et al.
Published: (2025)
by: Bell, Owen M., et al.
Published: (2025)
Semantic Tree-Width and Path-Width of Conjunctive Regular Path Queries
by: Figueira, Diego, et al.
Published: (2022)
by: Figueira, Diego, et al.
Published: (2022)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)
by: Murawski, Andrzej S., et al.
Published: (2020)
Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)
by: Di Stefano, Luca
Published: (2025)
Dynamic direct (ranked) access of MSO query evaluation over SLP-compressed strings
by: Muñoz, Martín
Published: (2026)
by: Muñoz, Martín
Published: (2026)
Execution and monitoring of HOA automata with HOAX
by: Di Stefano, Luca
Published: (2025)
by: Di Stefano, Luca
Published: (2025)
An automata-based approach for synchronizable mailbox communication
by: Delpy, Romain, et al.
Published: (2024)
by: Delpy, Romain, et al.
Published: (2024)
Word equations, constraints, and formal languages
by: Ciobanu, Laura
Published: (2024)
by: Ciobanu, Laura
Published: (2024)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Constant-delay enumeration for SLP-compressed documents
by: Muñoz, Martín, et al.
Published: (2022)
by: Muñoz, Martín, et al.
Published: (2022)
Message complexity for unary multiautomata systems
by: Choffrut, Christian
Published: (2024)
by: Choffrut, Christian
Published: (2024)
A framework for extraction and transformation of documents
by: Riveros, Cristian, et al.
Published: (2024)
by: Riveros, Cristian, et al.
Published: (2024)
SpotIt: Evaluating Text-to-SQL Evaluation with Formal Verification
by: Klopfenstein, Rocky, et al.
Published: (2025)
by: Klopfenstein, Rocky, et al.
Published: (2025)
A Myhill-Nerode Characterization and Active Learning for One-Clock Timed Automata
by: Doveri, Kyveli, et al.
Published: (2026)
by: Doveri, Kyveli, et al.
Published: (2026)
A Uniform Framework for Language Inclusion Problems
by: Doveri, Kyveli, et al.
Published: (2024)
by: Doveri, Kyveli, et al.
Published: (2024)
Characterising memory in infinite games
by: Casares, Antonio, et al.
Published: (2022)
by: Casares, Antonio, et al.
Published: (2022)
Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)
by: Colcombet, Thomas, et al.
Published: (2026)
A formal characterization of discrete condensed objects
by: Asgeirsson, Dagur
Published: (2024)
by: Asgeirsson, Dagur
Published: (2024)
A complete formalization of Fermat's Last Theorem for regular primes in Lean
by: Best, Alex, et al.
Published: (2024)
by: Best, Alex, et al.
Published: (2024)
A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)
by: Rooduijn, Jan, et al.
Published: (2024)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
The complexity of downward closures of indexed languages
by: Mandel, Richard, et al.
Published: (2026)
by: Mandel, Richard, et al.
Published: (2026)
A cartesian closed fibration of higher-order regular languages
by: Melliès, Paul-André, et al.
Published: (2026)
by: Melliès, Paul-André, et al.
Published: (2026)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)
by: Kuperberg, Denis
Published: (2022)
Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
Non-commutative linear logic fragments with sub-context-free complexity
by: Nishimiya, Yusaku, et al.
Published: (2025)
by: Nishimiya, Yusaku, et al.
Published: (2025)
Slice closures of indexed languages and word equations with counting constraints
by: Ciobanu, Laura, et al.
Published: (2024)
by: Ciobanu, Laura, et al.
Published: (2024)
A Hierarchy of Nondeterminism
by: Radi, Bader Abu, et al.
Published: (2022)
by: Radi, Bader Abu, et al.
Published: (2022)
Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)
by: Moreau, Vincent, et al.
Published: (2023)
A Dichotomy Theorem for Automatic Structures
by: Cuvelier, Antoine, et al.
Published: (2026)
by: Cuvelier, Antoine, et al.
Published: (2026)
A Completeness Theorem for Probabilistic Regular Expressions
by: Różowski, Wojciech, et al.
Published: (2023)
by: Różowski, Wojciech, et al.
Published: (2023)
Similar Items
-
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) -
Dynamic direct access of MSO query evaluation over strings
by: Bourhis, Pierre, et al.
Published: (2024) -
The structure of polynomial growth for tree automata/transducers and MSO set queries
by: Gallot, Paul, et al.
Published: (2025) -
A Trichotomy for Regular Trail Queries
by: Martens, Wim, et al.
Published: (2019)