Imagen de Portada

Transformers in Uniform TC$^0$

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Chiang, David
Formato:	Preprint
Publicado:	2024
Materias:	Computational Complexity Formal Languages and Automata Theory Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Exact Expressive Power of Transformers with Padding
por: Merrill, William, et al.
Publicado: (2025)

Context-Free Recognition with Transformers
por: Jerad, Selim, et al.
Publicado: (2026)

The Illusion of State in State-Space Models
por: Merrill, William, et al.
Publicado: (2024)

Why Are Linear RNNs More Parallelizable?
por: Merrill, William, et al.
Publicado: (2026)

Unique Hard Attention: A Tale of Two Sides
por: Jerad, Selim, et al.
Publicado: (2025)

Transformers Can Represent $n$-gram Language Models
por: Svete, Anej, et al.
Publicado: (2024)

Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't
por: Svete, Anej, et al.
Publicado: (2026)

Transformers as Transducers
por: Strobl, Lena, et al.
Publicado: (2024)

Unambiguous and Co-Nondeterministic Computations of Finite Automata and Pushdown Automata Families and the Effects of Multiple Counters
por: Yamakami, Tomoyuki
Publicado: (2024)

Complexity Aspects of the Extension of Wagner's Hierarchy to $k$-Partitions
por: Podolskii, Vladimir, et al.
Publicado: (2024)

Regular Expressions with Backreferences and Lookaheads Capture NLOG
por: Uezato, Yuya
Publicado: (2024)

Maximal Length Cellular Automata : A Survey
por: Adak, Sumit, et al.
Publicado: (2024)

Trading Determinism for Noncommutativity in Edmonds' Problem
por: Arvind, V., et al.
Publicado: (2024)

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples
por: Haneef, Farah
Publicado: (2024)

Complexity of Unary Exclusive Nondeterministic Finite Automata
por: Kutrib, Martin, et al.
Publicado: (2024)

Proceedings 14th International Workshop on Non-Classical Models of Automata and Applications (NCMA 2024)
por: Manea, Florin, et al.
Publicado: (2024)

Nondeterministic Auxiliary Depth-Bounded Storage Automata and Semi-Unbounded Fan-in Cascading Circuits
por: Yamakami, Tomoyuki
Publicado: (2024)

Synthesis of Timeline-Based Planning Strategies Avoiding Determinization
por: Acampora, Renato, et al.
Publicado: (2024)

Proceedings of the 15th International Workshop on Non-Classical Models of Automata and Applications
por: Moreira, Nelma, et al.
Publicado: (2025)

On the complexity of computing Strahler numbers
por: Ganardi, Moses, et al.
Publicado: (2025)

Constant-Space, Constant-Randomness Verifiers with Arbitrarily Small Error
por: Gezer, M. Utkan, et al.
Publicado: (2020)

Visibly Recursive Automata
por: Dubrulle, Kévin, et al.
Publicado: (2026)

Between SC and LOGDCFL: Families of Languages Accepted by Logarithmic-Space Deterministic Auxiliary Depth-k Storage Automata
por: Yamakami, Tomoyuki
Publicado: (2022)

Entropy of pebble automata and space complexity
por: Montoya, J. Andres
Publicado: (2026)

Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata
por: Yamakami, Tomoyuki
Publicado: (2023)

Intersection and Union Hierarchies of Deterministic Context-Free Languages and Pumping Lemmas
por: Yamakami, Tomoyuki
Publicado: (2021)

Studying homing and synchronizing sequences for Timed Finite State Machines with output delays
por: Vinarskii, Evgenii, et al.
Publicado: (2025)

The No Endmarker Theorem for One-Way Probabilistic Pushdown Automata
por: Yamakami, Tomoyuki
Publicado: (2021)

Complexity of Fungal Automaton Prediction
por: Formenti, Enrico, et al.
Publicado: (2026)

Regular Grammars as Effective Representations of Recognizable Sets of Series-Parallel Graphs
por: Bozga, Marius, et al.
Publicado: (2026)

Rational-Valued Affine Verifiers in Arthur--Merlin Proof Systems
por: Chen, Zeyu, et al.
Publicado: (2025)

Embedding arbitrary Boolean circuits into fungal automata with arbitrary update sequences
por: Goles, Eric, et al.
Publicado: (2026)

Infinite Time Turing Machines and their Applications
por: Weerawarana, Rukmal, et al.
Publicado: (2025)

SHAP Meets Tensor Networks: Provably Tractable Explanations with Parallelism
por: Marzouk, Reda, et al.
Publicado: (2025)

Counting Like Transformers: Compiling Temporal Counting Logic Into Softmax Transformers
por: Yang, Andy, et al.
Publicado: (2024)

Simulating Hard Attention Using Soft Attention
por: Yang, Andy, et al.
Publicado: (2024)

Matching walks that are minimal with respect to edge inclusion
por: Marsault, Victor
Publicado: (2024)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
por: Yang, Andy, et al.
Publicado: (2023)

Time complexity for deterministic string machines
por: Cataltepe, Ali, et al.
Publicado: (2024)

Membership and Conjugacy in Inverse Semigroups
por: Fleischer, Lukas, et al.
Publicado: (2025)