Imagen de Portada

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dhayalkar, Sahil Rajesh
Formato:	Preprint
Publicado:	2025
Materias:	Machine Learning Artificial Intelligence Formal Languages and Automata Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
por: Dhayalkar, Sahil Rajesh
Publicado: (2025)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
por: Dumitru, Radu Cosmin, et al.
Publicado: (2026)

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

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

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

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

MinMax Recurrent Neural Cascades
por: Ronca, Alessandro
Publicado: (2026)

Efficient Constructions of Finite-State Independent Normal Pairs
por: Pulari, Subin
Publicado: (2026)

A Finite-State Symbolic Automaton Model for the Collatz Map and Its Convergence Properties
por: Brauer, Leonard Ben Aurel
Publicado: (2025)

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

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
por: Hayashi, Katsuhiko, et al.
Publicado: (2025)

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

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

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

Active Inference of Extended Finite State Machine Models with Registers and Guards
por: Groz, Roland, et al.
Publicado: (2026)

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
por: Kuriyama, Takayuki
Publicado: (2026)

Implementing a Quantum Finite Automaton in IBMQ using Custom Control Pulses
por: Lussi, Eduardo Willwock, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

Finite-State Automaton To/From Regular Expression Visualization
por: Morazán, Marco T., et al.
Publicado: (2024)

LOGOS-CA: A Cellular Automaton Using Natural Language as State and Rule
por: Utimula, Keishu
Publicado: (2026)

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

Fast and General Automatic Differentiation for Finite-State Methods
por: Yang, Lucas Ondel, et al.
Publicado: (2026)

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

Modular Decomposition of Hierarchical Finite State Machines
por: Biggar, Oliver, et al.
Publicado: (2021)

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

Tokenization as Finite-State Transduction
por: Cognetta, Marco, et al.
Publicado: (2024)

Deconstructing Subset Construction -- Reducing While Determinizing
por: Nicol, John, et al.
Publicado: (2025)

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

Probabilistic Finite Automaton Emptiness is Undecidable for a Fixed Automaton
por: Rote, Günter
Publicado: (2024)

The Quadratic State Cost of Classical Simulation of One-Way Quantum Finite Automata
por: Chen, Zeyu, et al.
Publicado: (2026)