Transformers Are Inherently Succinct
·2026.05.05 05:03
Key point
It was shown that transformers express formal languages more succinctly, and that verification is EXPSPACE-complete.
Details
Proposed succinctness as a measure of transformer expressiveness.
- Proved that transformers can express formal languages far more succinctly than finite automata and LTL.
- As a trade-off for that expressiveness, verifying properties of transformers becomes EXPSPACE-complete.
In summary, this result shows that transformers have theoretically very compressive expressive power, and that this comes with a correspondingly large increase in verification difficulty.
This summary was generated automatically by AI. Check the original for the author's claims and context. Copyright belongs to the original author.
Our guide explains how the AI works. Report summary errors, attribution issues, or removal requests via Contact.