Umeå University's logo

umu.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
What formal languages can transformers express? a survey
Umeå University, Faculty of Science and Technology, Department of Computing Science.
New York University, United States.
EPFL, Switzerland.
University of Notre Dame, United States.
Show others and affiliations
2024 (English)In: Transactions of the Association for Computational Linguistics, E-ISSN 2307-387X, Vol. 12, p. 543-561Article in journal (Refereed) Published
Abstract [en]

As transformers have gained prominence in natural language processing, some researchers have investigated theoretically what problems they can and cannot solve, by treating problems as formal languages. Exploring such questions can help clarify the power of transformers relative to other models of computation, their fundamental capabilities and limits, and the impact of architectural choices. Work in this subarea has made considerable progress in recent years. Here, we undertake a comprehensive survey of this work, documenting the diverse assumptions that underlie different results and providing a unified framework for harmonizing seemingly contradictory findings.

Place, publisher, year, edition, pages
MIT Press, 2024. Vol. 12, p. 543-561
National Category
General Language Studies and Linguistics
Identifiers
URN: urn:nbn:se:umu:diva-225336DOI: 10.1162/tacl_a_00663ISI: 001259434600001Scopus ID: 2-s2.0-85193832932OAI: oai:DiVA.org:umu-225336DiVA, id: diva2:1864902
Available from: 2024-06-04 Created: 2024-06-04 Last updated: 2025-09-12Bibliographically approved
In thesis
1. Transformers as recognizers and transducers
Open this publication in new window or tab >>Transformers as recognizers and transducers
2025 (English)Doctoral thesis, comprehensive summary (Other academic)
Alternative title[sv]
Transformers som igenkännare och transduktorer
Abstract [en]

This thesis studies the computational expressivity of transformers from the perspective of formal language theory, circuit complexity, and transductions. It develops a unified framework that locates finite-precision transformer architectures within established constant-depth circuit classes and descriptive logics, and links their recognition power to well-known hierarchies of string-to-string functions.

The analysis focuses on architectures under explicit and realistic constraints: constant depth, O(log n) precision, and simple positional features. Under these assumptions, encoder-only transformers with average-hard attention lie within DLOGTIME-uniform TC0. With a small set of positional encodings, masked average-hard encoders can simulate a calculus that contains the aperiodic polyregular transductions. Together, these results point to constant-depth counting (e.g., prefix sums and majority) as a shared mechanism behind both recognition and transduction.

The thesis further shows that temperature-scaled softmax attention can match the selection behavior of unique-hard attention, and that for average-hard heads with a unique maximizer per query (uniform-tieless), the same outputs can be obtained without changing the learned weights by choosing a length-dependent temperature. It also characterizes trade-offs in succinct models: some table-lookup layouts can be solved by a single concise layer under structure-aware encodings, whereas structure-oblivious layouts require either additional depth or super-polylogarithmic communication size.

Throughout, constructive proofs are paired with reference implementations and learning experiments on synthetic tasks. This combination clarifies which theoretically possible behaviors emerge in practice and where learnability lags expressivity, especially for length extrapolation. The thesis concludes with open directions toward adaptive masking, resource-aware analyses, and conditions under which standard training enables the models to reach their theoretical potential, strengthening the bridge between formal methods and neural language modeling.

Place, publisher, year, edition, pages
Umeå: Umeå University, 2025. p. 34
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-244111 (URN)978-91-8070-790-9 (ISBN)978-91-8070-791-6 (ISBN)
Public defence
2025-10-07, SAM.A.280, Samhällsvetarhuset, Umeå, 13:00 (English)
Opponent
Supervisors
Available from: 2025-09-16 Created: 2025-09-11 Last updated: 2025-09-17Bibliographically approved

Open Access in DiVA

fulltext(419 kB)664 downloads
File information
File name FULLTEXT01.pdfFile size 419 kBChecksum SHA-512
7041a7ccf08369faf475bd43ed6a8d8d9a5675dd911d788ded7d36dc2f79f83e0b39c277c9d5aac4a4a9a012868071a661db36ed73aa378f602c34916d438e2a
Type fulltextMimetype application/pdf

Other links

Publisher's full textScopus

Authority records

Strobl, Lena

Search in DiVA

By author/editor
Strobl, Lena
By organisation
Department of Computing Science
In the same journal
Transactions of the Association for Computational Linguistics
General Language Studies and Linguistics

Search outside of DiVA

GoogleGoogle Scholar
Total: 664 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 600 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf