What Formal Languages Can Transformers Express? A Survey
Fuente:
arXiv
Saved in:
| Main Authors: | Strobl, Lena, Merrill, William, Weiss, Gail, Chiang, David, Angluin, Dana |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
by: Yang, Andy, et al.
Published: (2023)
by: Yang, Andy, et al.
Published: (2023)
Simulating Hard Attention Using Soft Attention
by: Yang, Andy, et al.
Published: (2024)
by: Yang, Andy, et al.
Published: (2024)
NILE: Formalizing Natural-Language Descriptions of Formal Languages
by: Kneisel, Tristan, et al.
Published: (2026)
by: Kneisel, Tristan, et al.
Published: (2026)
Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024)
by: Strobl, Lena, et al.
Published: (2024)
Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
by: Yang, Andy, et al.
Published: (2024)
by: Yang, Andy, et al.
Published: (2024)
Inferring Symbolic Automata
by: Fisman, Dana, et al.
Published: (2021)
by: Fisman, Dana, et al.
Published: (2021)
What is Formal Verification without Specifications? A Survey on mining LTL Specifications
by: Neider, Daniel, et al.
Published: (2025)
by: Neider, Daniel, et al.
Published: (2025)
Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
by: Angluin, Dana, et al.
Published: (2022)
by: Angluin, Dana, et al.
Published: (2022)
Formalizing zeta and L-functions in Lean
by: Loeffler, David, et al.
Published: (2025)
by: Loeffler, David, et al.
Published: (2025)
Length Generalization Bounds for Transformers
by: Yang, Andy, et al.
Published: (2026)
by: Yang, Andy, et al.
Published: (2026)
Logic and Languages of Higher-Dimensional Automata
by: Amrane, Amazigh, et al.
Published: (2024)
by: Amrane, Amazigh, et al.
Published: (2024)
Language Equivalence is Undecidable in VASS with Restricted Nondeterminism
by: Czerwiński, Wojciech, et al.
Published: (2025)
by: Czerwiński, Wojciech, et al.
Published: (2025)
Characterization and Decidability of FC-Definable Regular Languages
by: Thompson, Sam M., et al.
Published: (2025)
by: Thompson, Sam M., et al.
Published: (2025)
A Uniform Framework for Language Inclusion Problems
by: Doveri, Kyveli, et al.
Published: (2024)
by: Doveri, Kyveli, et al.
Published: (2024)
Algebraic Characterizations of Classes of Regular Languages in DynFO
by: Barloy, Corentin, et al.
Published: (2026)
by: Barloy, Corentin, et al.
Published: (2026)
Random Graph Generation in Context-Free Graph Languages
by: Vastarini, Federico, et al.
Published: (2024)
by: Vastarini, Federico, et al.
Published: (2024)
Language Inclusion for Boundedly-Ambiguous Vector Addition Systems is Decidable
by: Czerwiński, Wojciech, et al.
Published: (2022)
by: Czerwiński, Wojciech, et al.
Published: (2022)
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages
by: Mandrioli, Dino, et al.
Published: (2020)
by: Mandrioli, Dino, et al.
Published: (2020)
A Practical Specification Language for Automatic Quantum Program Verification (Technical Report)
by: Tsai, Wei-Lun, et al.
Published: (2026)
by: Tsai, Wei-Lun, et al.
Published: (2026)
Automatic Generation of Safety-compliant Linear Temporal Logic via Large Language Model: A Self-supervised Framework
by: Li, Junle, et al.
Published: (2025)
by: Li, Junle, et al.
Published: (2025)
The Big-O Problem for Max-Plus Automata is Decidable (PSPACE-Complete)
by: Daviaud, Laure, et al.
Published: (2023)
by: Daviaud, Laure, et al.
Published: (2023)
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata
by: Jecker, Ismaël, et al.
Published: (2023)
by: Jecker, Ismaël, et al.
Published: (2023)
A Direct Translation from LTL with Past to Deterministic Rabin Automata
by: Azzopardi, Shaun, et al.
Published: (2024)
by: Azzopardi, Shaun, et al.
Published: (2024)
Categorical Foundations of Formalized Condensed Mathematics
by: Asgeirsson, Dagur, et al.
Published: (2024)
by: Asgeirsson, Dagur, et al.
Published: (2024)
String Solving with Stabilization and Transducers (Technical Report)
by: Chocholatý, David, et al.
Published: (2026)
by: Chocholatý, David, et al.
Published: (2026)
Robust Probabilistic Bisimilarity for Labelled Markov Chains
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)
by: Fatmi, Syyeda Zainab, et al.
Published: (2025)
Proceedings Fifteenth International Symposium on Games, Automata, Logics, and Formal Verification
by: Achilleos, Antonis, et al.
Published: (2024)
by: Achilleos, Antonis, et al.
Published: (2024)
A cyclic proof system for Guarded Kleene Algebra with Tests (full version)
by: Rooduijn, Jan, et al.
Published: (2024)
by: Rooduijn, Jan, et al.
Published: (2024)
A proof theory of right-linear (omega-)grammars via cyclic proofs
by: Das, Anupam, et al.
Published: (2024)
by: Das, Anupam, et al.
Published: (2024)
The Alternation Hierarchy of First-Order Logic on Words is Decidable
by: Barloy, Corentin, et al.
Published: (2025)
by: Barloy, Corentin, et al.
Published: (2025)
Positive First-order Logic on Words and Graphs
by: Kuperberg, Denis
Published: (2022)
by: Kuperberg, Denis
Published: (2022)
An algebraic theory of ω-regular languages, via μν-expressions
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Function spaces for orbit-finite sets
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
by: Bojańczyk, Mikołaj, et al.
Published: (2024)
An efficient quantifier elimination procedure for Presburger arithmetic
by: Haase, Christoph, et al.
Published: (2024)
by: Haase, Christoph, et al.
Published: (2024)
Cyclic system for an algebraic theory of alternating parity automata
by: Das, Anupam, et al.
Published: (2025)
by: Das, Anupam, et al.
Published: (2025)
Relating Reversible Petri Nets and Reversible Event Structures, categorically
by: Melgratti, Hernán, et al.
Published: (2023)
by: Melgratti, Hernán, et al.
Published: (2023)
Parikh's Theorem Made Symbolic
by: Hague, Matthew, et al.
Published: (2023)
by: Hague, Matthew, et al.
Published: (2023)
Analyzing Robustness of Angluin's L$^*$ Algorithm in Presence of Noise
by: Ye, Lina, et al.
Published: (2023)
by: Ye, Lina, et al.
Published: (2023)
On-the-fly Unfolding with Optimal Exploration for Linear Temporal Logic Model Checking of Concurrent Software and Systems
by: Li, Shuo, et al.
Published: (2023)
by: Li, Shuo, et al.
Published: (2023)
Parikh Automata on Finite and Infinite Words
by: Grobler, Mario, et al.
Published: (2023)
by: Grobler, Mario, et al.
Published: (2023)
Similar Items
-
Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
by: Yang, Andy, et al.
Published: (2023) -
Simulating Hard Attention Using Soft Attention
by: Yang, Andy, et al.
Published: (2024) -
NILE: Formalizing Natural-Language Descriptions of Formal Languages
by: Kneisel, Tristan, et al.
Published: (2026) -
Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024) -
Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
by: Yang, Andy, et al.
Published: (2024)