Cover Image

An Automaton-based Characterisation of First-Order Logic over Infinite Trees

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Benerecetti, Massimo, Della Monica, Dario, Matteo, Angelo, Mogavero, Fabio, Puppis, Gabriele
Format:	Preprint
Published:	2025
Subjects:	Logic in Computer Science Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Automaton-based Characterisations of First Order Logic over Infinite Trees
by: Benerecetti, Massimo, et al.
Published: (2026)

Minimization of Streaming Transducers
by: Bianchini, Christian, et al.
Published: (2026)

First-Order Intuitionistic Linear Logic and Hypergraph Languages
by: Pshenitsyn, Tikhon
Published: (2025)

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

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

Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)

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

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

Synthesizing Computable Functions from Rational Specifications over Infinite Words
by: Filiot, Emmanuel, et al.
Published: (2021)

Characterising memory in infinite games
by: Casares, Antonio, et al.
Published: (2022)

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

Large Scale Geometries of Infinite Strings
by: Khoussainov, Bakhadyr, et al.
Published: (2019)

Beyond Decisiveness of Infinite Markov Chains
by: Barbot, Benoît, et al.
Published: (2024)

Quasi-Isometric Reductions Between Infinite Strings
by: Celine, Karen Frilya, et al.
Published: (2024)

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

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

Logics for Context-free Hyperproperties
by: Winter, Sarah, et al.
Published: (2026)

Positional Properties in Temporal Logic
by: Newman, Jessica, et al.
Published: (2026)

Robust Probabilistic Temporal Logics
by: Zimmermann, Martin
Published: (2023)

Some properties of $β$-$η$-normal forms in $λ$-K-calculus (Alcune proprietá delle forme $β$-$η$-normali nel $λ$-K-calcolo)
by: Böhm, Corrado, et al.
Published: (2025)

A Diamond Structure in the Transducer Hierarchy
by: Kaufmann, Noah
Published: (2021)

The Decision Problem for Regular First-Order Theories
by: Mathur, Umang, et al.
Published: (2024)

Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)

Bisimulations and Logics for Higher-Dimensional Automata
by: Zouari, Safa, et al.
Published: (2024)

Finite-valued Streaming String Transducers
by: Filiot, Emmanuel, et al.
Published: (2024)

Positive Hennessy-Milner Logic for Branching Bisimulation
by: Geuvers, Herman, et al.
Published: (2022)

On The Space Complexity of Partial Derivatives of Regular Expressions with Shuffle
by: Ancona, Davide, et al.
Published: (2025)

The Treewidth Boundedness Problem for an Inductive Separation Logic of Relations
by: Bozga, Marius, et al.
Published: (2023)

SENTIL: A Runtime Verification Tool for Probabilistic Temporal Logic
by: Quansah, Paapa Kwesi, et al.
Published: (2026)

A Complete Propositional Dynamic Logic for Regular Expressions with Lookahead
by: Nakamura, Yoshiki
Published: (2026)

Online Monitoring of Metric Temporal Logic using Sequential Networks
by: Ulus, Dogan
Published: (2019)

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

On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)

Complexity of Model Checking Second-Order Hyperproperties on Finite Structures
by: Finkbeiner, Bernd, et al.
Published: (2026)

Uncertainty Removal in Verification of Nonlinear Systems against Signal Temporal Logic via Incremental Reachability Analysis
by: Besset, Antoine, et al.
Published: (2025)

Automata-less Monitoring via Trace-Checking (Extended Version)
by: Brunello, Andrea, et al.
Published: (2025)

Characterizations of Monadic Second Order Definable Context-Free Sets of Graphs
by: Iosif, Radu, et al.
Published: (2023)

Existential Definability over the Subword Ordering
by: Baumann, Pascal, et al.
Published: (2022)

Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, 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)