Partial Answer of How Transformers Learn Automata
Not on the map. Why?
Abstract (arXiv)
We introduce a novel framework for simulating finite automata using representation-theoretic semidirect products and Fourier modules, achieving more efficient Transformer-based implementations.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 6 references that are in the map. First posted on arXiv 29 Apr 2025.
Builds on
2 of 6 references.
References · 2
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,200
- 2022Transformers Learn Shortcuts to Automatacited by 268
Built on by
Not cited yet.