Cover Image

The structure of polynomial growth for tree automata/transducers and MSO set queries

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gallot, Paul, Lhote, Nathan, Nguyên, Lê Thành Dũng
Format:	Preprint
Published:	2025
Subjects:	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

Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
by: Dartois, Luc, et al.
Published: (2026)

Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)

Expregular functions
by: Colcombet, Thomas, et al.
Published: (2026)

Slightly Non-Linear Higher-Order Tree Transducers
by: Nguyên, Lê Thành Dũng, et al.
Published: (2024)

Two or three things I know about tree transducers
by: Nguyên, Lê Thành Dũng
Published: (2024)

Syntactically and semantically regular languages of lambda-terms coincide through logical relations
by: Moreau, Vincent, et al.
Published: (2023)

Synthesis of Computable Regular Functions of Infinite Words
by: Dave, V., et al.
Published: (2019)

A formal query language and automata model for aggregation in complex event recognition
by: Bourhis, Pierre, 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)

Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)

Symbolic ω-automata with obligations
by: Di Stefano, Luca
Published: (2025)

Bisimilarity in fresh-register automata
by: Murawski, Andrzej S., et al.
Published: (2020)

Execution and monitoring of HOA automata with HOAX
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)

An automata-based approach for synchronizable mailbox communication
by: Delpy, Romain, et al.
Published: (2024)

CMSO-transducing tree-like graph decompositions
by: Campbell, Rutger, et al.
Published: (2024)

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

The role of counting quantifiers in laminar set systems
by: Campbell, Rutger, et al.
Published: (2025)

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

HistMSO: A Logic for Reasoning about Consistency Models with MONA
by: Coget, Isabelle, et al.
Published: (2026)

Decision Questions for Probabilistic Automata on Small Alphabets
by: Bell, Paul C., et al.
Published: (2021)

High-Level Message Sequence Charts: Satisfiability and Realizability Revisited
by: Bollig, Benedikt, et al.
Published: (2025)

Rethinking meaning and ontologies from the perspective of ontological units
by: Fabry, Paul, et al.
Published: (2025)

Monitorability for the Modal mu-Calculus over Systems with Data: From Practice to Theory
by: Aceto, Luca, et al.
Published: (2025)

The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)

An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)

A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
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)

Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)

An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)

Profinite trees, through Lawvere theories and the lambda-calculus
by: Moreau, Vincent
Published: (2024)

The $\mathsf{AC}^0$-Complexity Of Visibly Pushdown Languages
by: Göller, Stefan, et al.
Published: (2023)

The Queue Automaton Revisited
by: Baeten, Jos C. M., et al.
Published: (2025)

Simplifying LTL Model Checking Given Prior Knowledge
by: Duret-Lutz, Alexandre, et al.
Published: (2025)

Determinization of Min-Plus Weighted Automata is Decidable
by: Almagor, Shaull, et al.
Published: (2025)

Unreliability in Practical Subclasses of Communicating Systems
by: Suresh, Amrita, et al.
Published: (2025)

Proceedings of the Combined 32nd International Workshop on Expressiveness in Concurrency and 22nd Workshop on Structural Operational Semantics
by: Di Giusto, Cinzia, et al.
Published: (2025)

Parameterized Verification of Quantum Circuits (Technical Report)
by: Abdulla, Parosh Aziz, et al.
Published: (2025)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)

DTMC Model Checking by Path Abstraction Revisited (extended version)
by: Hartmanns, Arnd, et al.
Published: (2025)