Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability
Sahil Rajesh Dhayalkar

TL;DR
This paper introduces a novel neural network architecture that precisely simulates Alternating Finite Automata, enabling exact automaton simulation and learnability from data.
Contribution
It proposes Logic-Gated Time-Shared Feedforward Networks that structurally mimic AFAs, capturing their exponential succinctness and allowing learnability via gradient descent.
Findings
Exact simulation of AFA reachability dynamics by the network.
The architecture can represent regular languages with exponentially fewer neurons.
Empirical results show successful recovery of automata from data.
Abstract
We present a formal and constructive framework for simulating Alternating Finite Automata (AFAs) using Logic-Gated Time-Shared Feedforward Networks (LG-TS-FFNs). Unlike prior neural automata models limited to Nondeterministic Finite Automata (NFAs) and existential reachability, our architecture integrates learnable, state-dependent biases that function as differentiable logic gates, enabling the representation of both Existential \textsc{\textsc{OR}} and Universal \textsc{\textsc{AND}} aggregation within a shared-parameter linear recurrence. We prove that this architectural modification upgrades the network's computational class to be structurally isomorphic to AFAs, thereby inheriting their exponential succinctness: the network can represent regular languages requiring states in an NFA with only neurons. We rigorously establish that the forward pass of an LG-TS-FFN exactly…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
