Cover Image

Computing measures of weak-MSO definable sets of trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Niwiński, Damian, Przybyłko, Marcin, Skrzypczak, Michał
Format:	Preprint
Published:	2024
Subjects:	Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Generalised Quantifiers Based on Rabin-Mostowski Index
by: Kuperberg, Denis, et al.
Published: (2026)

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

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

Algebraic Characterization of FO-definable Languages of Higher-Dimensional Automata
by: Erlich, Enzo, et al.
Published: (2026)

Extended time Petri nets
by: Radom, Marcin, et al.
Published: (2024)

Efficient Analysis of Polynomial Asymptotic Estimates for VASS MDPs
by: Ajdarów, Michal
Published: (2025)

Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)

Automata for the commutative closure of regular sets
by: Becher, Verónica, et al.
Published: (2025)

The complexity of separability for semilinear sets and Parikh automata
by: Collins, Elias Rojas, et al.
Published: (2024)

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

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

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

Computational Complexity of Alignments
by: Schwanen, Christopher T., et al.
Published: (2026)

Box-Reachability in Vector Addition Systems
by: Almagor, Shaull, et al.
Published: (2025)

Computational Model for Parsing Expression Grammars
by: Rubtsov, Alexander, et al.
Published: (2024)

Characterization of deterministically recognizable weighted tree languages over commutative semifields by finitely generated and cancellative scalar algebras
by: Fülöp, Zoltán, et al.
Published: (2025)

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

Undecidability of the Emptiness Problem for Weak Models of Distributed Computing
by: Principato, Flavio T., et al.
Published: (2025)

On the Complexity of Computing the Co-lexicographic Width of a Regular Language
by: Becker, Ruben, et al.
Published: (2024)

A Characterization of Turing Machines that Compute Primitive Recursive Functions
by: Schwartz, Daniel G.
Published: (2025)

Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
by: Bell, Jason P., et al.
Published: (2022)

TuringQ: Benchmarking AI Comprehension in Theory of Computation
by: Zahraei, Pardis Sadat, et al.
Published: (2024)

Over-approximation of weakly-hard constraints for control systems verification (Extended)
by: de Maeyer, Rieke, et al.
Published: (2026)

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)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Distribution of Reconfiguration Languages maintaining Tree-like Communication Topology
by: Hausmann, Daniel, et al.
Published: (2024)

Characterization of Isometric Words based on Swap and Mismatch Distance
by: Anselmo, M., et al.
Published: (2024)

$ω$-regular Expression Synthesis from Transition-Based Büchi Automata
by: Pert, Charles, et al.
Published: (2024)

Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)

Information-flow Interfaces and Security Lattices
by: Bartocci, Ezio, et al.
Published: (2024)

Synthesis from LTL with Reward Optimization in Sampled Oblivious Environments
by: Raskin, Jean-François, et al.
Published: (2024)

Two-Way One-Counter Nets Revisited
by: Almagor, Shaull, et al.
Published: (2024)

5' -> 3' Watson-Crick Automata accepting Necklaces
by: Nagy, Benedek
Published: (2024)

Reachability in One-Dimensional Pushdown Vector Addition Systems is Decidable
by: Bizière, Clotilde, et al.
Published: (2024)

QuAK: Quantitative Automata Kit
by: Chalupa, Marek, et al.
Published: (2024)

Development of parallel programs on shared data-structures -- Revised version
by: Stølen, Ketil
Published: (2024)

Exact descriptional complexity of determinization of input-driven pushdown automata
by: Martynova, Olga
Published: (2024)

Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
by: Aristote, Quentin
Published: (2024)