Saved in:
| Main Authors: | Suresh, Tarun, Wadhwa, Nalin, Banerjee, Debangshu, Singh, Gagandeep |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2512.05439 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
by: Ospanov, Azim, et al.
Published: (2025)
by: Ospanov, Azim, et al.
Published: (2025)
SynCode: LLM Generation with Grammar Augmentation
by: Ugare, Shubham, et al.
Published: (2024)
by: Ugare, Shubham, et al.
Published: (2024)
Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)
by: Fijalkow, Nathanaël, et al.
Published: (2026)
Inference of Deterministic Finite Automata via Q-Learning
by: Hosseinkhani, Elaheh, et al.
Published: (2025)
by: Hosseinkhani, Elaheh, et al.
Published: (2025)
Congruence-based Learning of Probabilistic Deterministic Finite Automata
by: Carrasco, Matías, et al.
Published: (2024)
by: Carrasco, Matías, et al.
Published: (2024)
Multimodal Pretrained Models for Verifiable Sequential Decision-Making: Planning, Grounding, and Perception
by: Yang, Yunhao, et al.
Published: (2023)
by: Yang, Yunhao, et al.
Published: (2023)
Enforcing Temporal Constraints for LLM Agents
by: Kamath, Adharsh, et al.
Published: (2025)
by: Kamath, Adharsh, et al.
Published: (2025)
ToolGate: Contract-Grounded and Verified Tool Execution for LLMs
by: Liu, Yanming, et al.
Published: (2026)
by: Liu, Yanming, et al.
Published: (2026)
RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
by: Jin, Hyundong, et al.
Published: (2025)
by: Jin, Hyundong, et al.
Published: (2025)
SELP: Generating Safe and Efficient Task Plans for Robot Agents with Large Language Models
by: Wu, Yi, et al.
Published: (2024)
by: Wu, Yi, et al.
Published: (2024)
Efficient Learning of Weak Deterministic Büchi Automata
by: Alluwayma, Mona, et al.
Published: (2025)
by: Alluwayma, Mona, et al.
Published: (2025)
Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)
by: Dhayalkar, Sahil Rajesh
Published: (2025)
Non-Deterministic Planning for Hyperproperty Verification
by: Beutner, Raven, et al.
Published: (2024)
by: Beutner, Raven, et al.
Published: (2024)
Lookahead Games and Efficient Determinisation of History-Deterministic Büchi Automata
by: Acharya, Rohan, et al.
Published: (2024)
by: Acharya, Rohan, et al.
Published: (2024)
Beyond Memorization: Testing LLM Reasoning on Unseen Theory of Computation Tasks
by: Shelat, Shlok, et al.
Published: (2026)
by: Shelat, Shlok, et al.
Published: (2026)
The 2-Token Theorem: Recognising History-Deterministic Parity Automata Efficiently
by: Lehtinen, Karoliina, et al.
Published: (2025)
by: Lehtinen, Karoliina, et al.
Published: (2025)
On the Minimisation of Deterministic and History-Deterministic Generalised (co)Büchi Automata
by: Casares, Antonio, et al.
Published: (2024)
by: Casares, Antonio, et al.
Published: (2024)
Probabilistic Modeling of Spiking Neural Networks with Contract-Based Verification
by: Yao, Zhen, et al.
Published: (2025)
by: Yao, Zhen, et al.
Published: (2025)
Mechanics of Learned Reasoning 1: TempoBench, A Benchmark for Interpretable Deconstruction of Reasoning System Performance
by: Holzer, Nikolaus, et al.
Published: (2025)
by: Holzer, Nikolaus, et al.
Published: (2025)
Foundation Models for Logistics: Toward Certifiable, Conversational Planning Interfaces
by: Yang, Yunhao, et al.
Published: (2025)
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)
by: Koohestani, Roham, et al.
Published: (2025)
On Synthesis of Timed Regular Expressions
by: Wang, Ziran, et al.
Published: (2025)
by: Wang, Ziran, et al.
Published: (2025)
In System Alignments we Trust! Explainable Alignments via Projections
by: Sommers, Dominique, et al.
Published: (2025)
by: Sommers, Dominique, et al.
Published: (2025)
Stochastic Directly-Follows Process Discovery Using Grammatical Inference
by: Alkhammash, Hanan, et al.
Published: (2023)
by: Alkhammash, Hanan, et al.
Published: (2023)
LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)
by: Chen, Lekai, et al.
Published: (2024)
Large Language Models and the Extended Church-Turing Thesis
by: Wiedermann, Jiří, et al.
Published: (2024)
by: Wiedermann, Jiří, et al.
Published: (2024)
TheoremLlama: Transforming General-Purpose LLMs into Lean4 Experts
by: Wang, Ruida, et al.
Published: (2024)
by: Wang, Ruida, et al.
Published: (2024)
Finding path and cycle counting formulae in graphs with Deep Reinforcement Learning
by: Piquenot, Jason, et al.
Published: (2024)
by: Piquenot, Jason, et al.
Published: (2024)
Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
by: Dhayalkar, Sahil Rajesh
Published: (2026)
by: Dhayalkar, Sahil Rajesh
Published: (2026)
The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
by: Dantas, PIerre, et al.
Published: (2025)
by: Dantas, PIerre, et al.
Published: (2025)
When is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
by: Maneth, Sebastian, et al.
Published: (2025)
by: Maneth, Sebastian, et al.
Published: (2025)
Analyzing constrained LLM through PDFA-learning
by: Carrasco, Matías, et al.
Published: (2024)
by: Carrasco, Matías, et al.
Published: (2024)
History-Deterministic Büchi Automata are Succinct
by: Casares, Antonio, et al.
Published: (2026)
by: Casares, Antonio, et al.
Published: (2026)
Deterministic Parikh automata on infinite words
by: Grobler, Mario, et al.
Published: (2024)
by: Grobler, Mario, et al.
Published: (2024)
Hyper-Minimization for Deterministic Register Automata
by: Li, Yong, et al.
Published: (2026)
by: Li, Yong, et al.
Published: (2026)
Learning Deterministic Multi-Clock Timed Automata
by: Teng, Yu, et al.
Published: (2024)
by: Teng, Yu, et al.
Published: (2024)
Token Games and History-Deterministic Quantitative-Automata
by: Boker, Udi, et al.
Published: (2021)
by: Boker, Udi, et al.
Published: (2021)
HybridProver: Augmenting Theorem Proving with LLM-Driven Proof Synthesis and Refinement
by: Hu, Jilin, et al.
Published: (2025)
by: Hu, Jilin, et al.
Published: (2025)
Active Learning of Deterministic Transducers with Outputs in Arbitrary Monoids
by: Aristote, Quentin
Published: (2024)
by: Aristote, Quentin
Published: (2024)
Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)
by: Dvorak, Martin, et al.
Published: (2023)
Similar Items
-
HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs
by: Ospanov, Azim, et al.
Published: (2025) -
SynCode: LLM Generation with Grammar Augmentation
by: Ugare, Shubham, et al.
Published: (2024) -
Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026) -
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)