AI RESEARCH
Warm Starting State-Space Models with Automata Learning
arXiv CS.LG
•
ArXi:2603.05694v1 Announce Type: new We prove that Moore machines can be exactly realized as state-space models (SSMs), establishing a formal correspondence between symbolic automata and these continuous machine learning architectures. These Moore-SSMs preserve both the complete symbolic structure and input-output behavior of the original Moore machine, but operate in Euclidean space. With this correspondence, we compare the