Cover Image

MinMax Recurrent Neural Cascades

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Ronca, Alessandro
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence Formal Languages and Automata Theory
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On The Expressivity of Recurrent Neural Cascades
by: Knorozova, Nadezda Alexandrovna, et al.
Published: (2023)

On the Expressivity of Recurrent Neural Cascades with Identity
by: Knorozova, Nadezda Alexandrovna, et al.
Published: (2024)

Tractable Offline Learning of Regular Decision Processes
by: Deb, Ahana, et al.
Published: (2024)

The Transformation Logics
by: Ronca, Alessandro
Published: (2023)

Extracting Robust Register Automata from Neural Networks over Data Sequences
by: Hong, Chih-Duo, et al.
Published: (2025)

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

Reasoning about Reasoning: BAPO Bounds on Chain-of-Thought Token Complexity in LLMs
by: Tomlinson, Kiran, et al.
Published: (2026)

Robust Probabilistic Model Checking with Continuous Reward Domains
by: Ji, Xiaotong, et al.
Published: (2025)

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

Lost in Transmission: When and Why LLMs Fail to Reason Globally
by: Schnabel, Tobias, et al.
Published: (2025)

Expressive Reward Synthesis with the Runtime Monitoring Language
by: Donnelly, Daniel, et al.
Published: (2025)

Probabilistic Regular Tree Priors for Scientific Symbolic Reasoning
by: Schneider, Tim, et al.
Published: (2023)

Analyzing constrained LLM through PDFA-learning
by: Carrasco, Matías, et al.
Published: (2024)

Learning Formal Specifications from Membership and Preference Queries
by: Shah, Ameesh, et al.
Published: (2023)

The Sparse Tsetlin Machine: Sparse Representation with Active Literals
by: Østby, Sebastian, et al.
Published: (2024)

Hilbert: Recursively Building Formal Proofs with Informal Reasoning
by: Varambally, Sumanth, et al.
Published: (2025)

Exploring Major Transitions in the Evolution of Biological Cognition With Artificial Neural Networks
by: Voudouris, Konstantinos, et al.
Published: (2025)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
by: Okudono, Takamasa, et al.
Published: (2024)

TeLoGraF: Temporal Logic Planning via Graph-encoded Flow Matching
by: Meng, Yue, et al.
Published: (2025)

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

Language Generation: Complexity Barriers and Implications for Learning
by: Arenas, Marcelo, et al.
Published: (2025)

Compositional Automata Embeddings for Goal-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2024)

The Lottery LLM Hypothesis, Rethinking What Abilities Should LLM Compression Preserve?
by: Tang, Zhenheng, et al.
Published: (2025)

Automata Extraction from Transformers
by: Zhang, Yihao, et al.
Published: (2024)

Provably Correct Automata Embeddings for Optimal Automata-Conditioned Reinforcement Learning
by: Yalcinkaya, Beyazit, et al.
Published: (2025)

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)

InductionBench: LLMs Fail in the Simplest Complexity Class
by: Hua, Wenyue, et al.
Published: (2025)

Formal-LLM: Integrating Formal Language and Natural Language for Controllable LLM-based Agents
by: Li, Zelong, et al.
Published: (2024)

FormalAlign: Automated Alignment Evaluation for Autoformalization
by: Lu, Jianqiao, et al.
Published: (2024)

An Algebraic View of the Expressivity of Recurrent Language Models
by: Nowak, Franz, et al.
Published: (2026)

Unambiguisability and Register Minimisation of Min-Plus Models
by: Almagor, Shaull, et al.
Published: (2025)

Neural Theorem Proving: Generating and Structuring Proofs for Formal Verification
by: Rao, Balaji, et al.
Published: (2025)

The $μ\mathcal{G}$ Language for Programming Graph Neural Networks
by: Belenchia, Matteo, et al.
Published: (2024)

Passive Learning of Lattice Automata from Recurrent Neural Networks
by: Slimi, Jaouhar, et al.
Published: (2025)

The 4/$δ$ Bound: Designing Predictable LLM-Verifier Systems for Formal Method Guarantee
by: Dantas, PIerre, et al.
Published: (2025)

Infinite Time Turing Machines and their Applications
by: Weerawarana, Rukmal, et al.
Published: (2025)

Automata Learning of Preferences over Temporal Logic Formulas from Pairwise Comparisons
by: Rahmani, Hazhar, et al.
Published: (2025)

A New Era in Software Security: Towards Self-Healing Software via Large Language Models and Formal Verification
by: Tihanyi, Norbert, et al.
Published: (2023)

A Complexity Bound for Determinisation of Min-Plus Weighted Automata
by: Almagor, Shaull, et al.
Published: (2026)

Computing the Reachability Value of Posterior-Deterministic POMDPs
by: Fijalkow, Nathanaël, et al.
Published: (2026)