:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Fijalkow, Nathanaël, Ghosh, Arka, Kniazev, Roman, Pérez, Guillermo A., Vandenhove, Pierre
Format:	Preprint
Published:	2026
Subjects:	Artificial Intelligence Formal Languages and Automata Theory
Online Access:	https://arxiv.org/abs/2602.07473
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

LTL$_f$ Learning Meets Boolean Set Cover
by: Bathie, Gabriel, et al.
Published: (2025)

Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic
by: Raha, Ritam, et al.
Published: (2021)

Playing Safe, Ten Years Later
by: Colcombet, Thomas, et al.
Published: (2022)

BEAVER: An Efficient Deterministic LLM Verifier
by: Suresh, Tarun, et al.
Published: (2025)

Inference of Deterministic Finite Automata via Q-Learning
by: Hosseinkhani, Elaheh, et al.
Published: (2025)

Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)

Half-Positional Objectives Recognized by Deterministic Büchi Automata
by: Bouyer, Patricia, et al.
Published: (2022)

Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
by: Piquenot, Jason, et al.
Published: (2024)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

Reachability in Trace-Pushdown Systems
by: Köcher, Chris, et al.
Published: (2025)

Non-Deterministic Planning for Hyperproperty Verification
by: Beutner, Raven, et al.
Published: (2024)

Reachability in VASS Extended with Integer Counters
by: Bizière, Clotilde, et al.
Published: (2026)

On the Separability Problem of VASS Reachability Languages
by: Keskin, Eren, et al.
Published: (2024)

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

Completely Reachable Almost Group Automata
by: Torres, David Fernando Casas
Published: (2024)

Beyond Memorization: Testing LLM Reasoning on Unseen Theory of Computation Tasks
by: Shelat, Shlok, et al.
Published: (2026)

On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)

Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
by: Dhayalkar, Sahil Rajesh
Published: (2026)

Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
by: Yao, Zhen, et al.
Published: (2025)

Stochastic Directly-Follows Process Discovery Using Grammatical Inference
by: Alkhammash, Hanan, et al.
Published: (2023)

HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
by: Ospanov, Azim, et al.
Published: (2025)

LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)

Large Language Models and the Extended Church-Turing Thesis
by: Wiedermann, Jiří, et al.
Published: (2024)

TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts
by: Wang, Ruida, et al.
Published: (2024)

Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
by: Holzer, Nikolaus, et al.
Published: (2025)

RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
by: Jin, Hyundong, et al.
Published: (2025)

Multimodal Pretrained Models for Verifiable Sequential Decision-Making: Planning, Grounding, and Perception
by: Yang, Yunhao, et al.
Published: (2023)

Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
by: Yang, Yunhao, et al.
Published: (2025)

Are Agents Probabilistic Automata? A Trace-Based, Memory-Constrained Theory of Agentic AI
by: Koohestani, Roham, et al.
Published: (2025)

On Synthesis of Timed Regular Expressions
by: Wang, Ziran, et al.
Published: (2025)

In System Alignments we Trust! Explainable Alignments via Projections
by: Sommers, Dominique, et al.
Published: (2025)

Inform: From Compartmental Models to Stochastic Bounded Counter Machines
by: Leys, Tim, et al.
Published: (2024)

When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
by: Maneth, Sebastian, et al.
Published: (2025)

Computability of Agentic Systems
by: Viriyasuthee, Chatavut
Published: (2026)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

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

On-The-Fly Algorithm for Reachability in Parametric Timed Games (Extended Version)
by: Dahlsen-Jensen, Mikael Bisgaard, et al.
Published: (2024)

Reachability in symmetric VASS
by: Kamiński, Łukasz, et al.
Published: (2025)

History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)

Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)