Transformers Are Inherently Succinct

Computer Science > Formal Languages and Automata Theory arXiv:2510.19315 (cs) [Submitted on 22 Oct 2025 (v1), last revised 23 Oct 2025 (this version, v2)] Title:Transformers are Inherently Succinct Authors:Pascal Bergsträßer, Ryan Cotterell, Anthony W. Lin View a PDF of the paper titled Transformers are Inherently Succinct, by Pascal Bergstr\"a{\ss}er and 2 other authors View PDF HTML (experimental)

Abstract:We propose succinctness as a measure of the expressive power of a transformer in describing a concept. To this end, we prove that transformers are highly expressive in that they can represent formal languages substantially more succinctly than standard representations of formal languages like finite automata and Linear Temporal Logic (LTL) formulas. As a by-product of this expressivity, we show that verifying properties of transformers is provably intractable (i.e. EXPSPACE-complete).

Subjects:	Formal Languages and Automata Theory (cs.FL); Machine Learning (cs.LG); Logic in Computer Science (cs.LO)
Cite as:	arXiv:2510.19315 [cs.FL]
	(or arXiv:2510.19315v2 [cs.FL] for this version)
	https://doi.org/10.48550/arXiv.2510.19315 Focus to learn more arXiv-issued DOI via DataCite

Submission history

From: Pascal Bergsträßer [view email]
[v1] Wed, 22 Oct 2025 07:25:54 UTC (28 KB)
[v2] Thu, 23 Oct 2025 08:09:19 UTC (28 KB)
Full-text links:

Access Paper:

View a PDF of the paper titled Transformers are Inherently Succinct, by Pascal Bergstr\"a{\ss}er and 2 other authors
• View PDF
• HTML (experimental)
• TeX Source

view license

Current browse context:

cs.FL < prev   |   next >
new | recent | 2025-10 Change to browse by: cs
cs.LG
cs.LO

References & Citations

• NASA ADS
• Google Scholar
• Semantic Scholar

export BibTeX citation Loading...

BibTeX formatted citation

× loading... Data provided by:

Bookmark

Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?)

• Author
• Venue
• Institution
• Topic

About arXivLabs arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)