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
Transformers as transducers
Umeå University, Faculty of Science and Technology, Department of Computing Science.
Yale University, United States.
University of Notre Dame, United States.
San José State University, United States.
Show others and affiliations
2025 (English)In: Transactions of the Association for Computational Linguistics, E-ISSN 2307-387X, Vol. 13, p. 200-219Article in journal (Refereed) Published
Abstract [en]

We study the sequence-to-sequence mapping capacity of transformers by relating them to finite transducers, and find that they can express surprisingly large classes of (total functional) transductions. We do so using variants of RASP, a programming language designed to help people “think like transformers,” as an intermediate representation. We extend the existing Boolean variant B-RASP to sequence-to-sequence transductions and show that it computes exactly the first-order rational transductions (such as string rotation). Then, we introduce two new extensions. B-RASP[pos] enables calculations on positions (such as copying the first half of a string) and contains all first-order regular transductions. S-RASP adds prefix sum, which enables additional arithmetic operations (such as squaring a string) and contains all first-order polyregular transductions. Finally, we show that masked average-hard attention transformers can simulate S-RASP.

Place, publisher, year, edition, pages
MIT Press, 2025. Vol. 13, p. 200-219
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:umu:diva-242255DOI: 10.1162/tacl_a_00736ISI: 001436318200002Scopus ID: 2-s2.0-105010222957OAI: oai:DiVA.org:umu-242255DiVA, id: diva2:1984735
Available from: 2025-07-17 Created: 2025-07-17 Last updated: 2025-10-09Bibliographically 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(493 kB)20 downloads
File information
File name FULLTEXT02.pdfFile size 493 kBChecksum SHA-512
18c1ebd2e803416fb667964a3c23ddb08e61001f3c8fa347297de49f5a48c0194763cdfc996d37f809f585603c26f72a8632702534ea046304b4a2e90c171235
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
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar
Total: 64 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: 373 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