:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Piórkowski, Radosław
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2602.13120
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal quantification makes automatic structures hard to decide
by: Haase, Christoph, et al.
Published: (2023)

Decidability of MSO Reparameterization over Countable Chains
by: Rabinovich, Alexander
Published: (2026)

Low rank MSO
by: Bojańczyk, Mikołaj, et al.
Published: (2025)

A Subclass of Mu-Calculus with the Freeze Quantifier Equivalent to Buchi Register Automata
by: Takata, Yoshiaki, et al.
Published: (2024)

A Dichotomy Theorem for Ordinal Ranks in MSO
by: Niwiński, Damian, et al.
Published: (2025)

Tree algebras and bisimulation-invariant MSO on finite graphs
by: Colcombet, Thomas, et al.
Published: (2024)

Forbidden Induced Subgraphs for Bounded Shrub-Depth and the Expressive Power of MSO
by: Mählmann, Nikolas
Published: (2025)

Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)

Set Automata and Limits of Decidability of Two-Variable Logic on Data Words
by: Guha, Shibashis, et al.
Published: (2026)

Ranked Enumeration for MSO on Trees via Knowledge Compilation
by: Amarilli, Antoine, et al.
Published: (2023)

Towards Efficient Matching of Regexes with Backreferences using Register Set Automata (Technical Report)
by: Havlena, Vojtěch, et al.
Published: (2022)

FO logic on cellular automata orbits equals MSO logic
by: Theyssier, Guillaume
Published: (2024)

Coinductive Proofs of Regular Expression Equivalence in Zero Knowledge
by: Kolesar, John, et al.
Published: (2025)

One-Dimensional Fragment over Words and Trees
by: Kieronski, Emanuel, et al.
Published: (2021)

MSO Queries on Trees: Enumerating Answers under Updates Using Forest Algebras
by: Kleest-Meißner, Sarah, et al.
Published: (2022)

Step Automata
by: Wang, Yong
Published: (2026)

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

Homomorphism Indistinguishability, Multiplicity Automata Equivalence, and Polynomial Identity Testing
by: Černý, Marek, et al.
Published: (2025)

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

Automata for Enriched Trees and Applications
by: Blumensath, Achim
Published: (2025)

Overview and Roadmap of Team Automata
by: ter Beek, Maurice H., 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)

Graph neural networks and MSO
by: Ahvonen, Veeti, et al.
Published: (2025)

Compositional Reasoning for Probabilistic Automata with Uncertainty
by: Mertens, Hannah, et al.
Published: (2026)

Runtime Verification of Interactions Using Automata
by: Weil-Kennedy, Chana, et al.
Published: (2025)

Petri Nets and Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2025)

Constraint Automata on Infinite Data Trees: From CTL(Z)/CTL*(Z) To Decision Procedures
by: Demri, Stephane, et al.
Published: (2023)

Equivalence and Conditional Independence in Atomic Sheaf Logic
by: Simpson, Alex
Published: (2024)

An Expressive Coalgebraic Modal Logic for Cellular Automata
by: Basold, Henning, et al.
Published: (2025)

Small Test Suites for Active Automata Learning
by: Kruger, Loes, et al.
Published: (2024)

Automata Linear Dynamic Logic on Finite Traces
by: Smith, Kevin W., et al.
Published: (2021)

Sound Conflict Analysis for Timed Contract Automata
by: Azzopardi, Shaun, et al.
Published: (2024)

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

Automata-Theoretic Characterisations of Branching-Time Temporal Logics
by: Benerecetti, Massimo, et al.
Published: (2024)

POPACheck: A Model Checker for Probabilistic Pushdown Automata
by: Pontiggia, Francesco, et al.
Published: (2025)

Compositional Reasoning for Parametric Probabilistic Automata
by: Mertens, Hannah, et al.
Published: (2025)

Stuttering Equivalence for Parity Games
by: Cranen, Sjoerd, et al.
Published: (2011)

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
by: André, Étienne, et al.
Published: (2023)

Graded Monads and Behavioural Equivalence Games
by: Ford, Chase, et al.
Published: (2022)

Proceedings of the Sixteenth International Symposium on Games, Automata, Logics, and Formal Verification
by: Bacci, Giorgio, et al.
Published: (2025)