{"total":43,"rows":[{"id":"2402.09268","title":"Transformers, parallel computation, and logarithmic depth","created":"2024-02-14","cited_by_count":79,"area":null},{"id":"2403.01632","title":"SynCode: LLM Generation with Grammar Augmentation","created":"2024-03-03","cited_by_count":69,"area":null},{"id":"2502.19249","title":"Between Circuits and Chomsky: Pre-pretraining on Formal Languages Imparts Linguistic Biases","created":"2025-02-26","cited_by_count":37,"area":null},{"id":"2504.09246","title":"Type-Constrained Code Generation with Language Models","created":"2025-04-12","cited_by_count":35,"area":null},{"id":"2506.12027","title":"Constant Bit-size Transformers Are Turing Complete","created":"2025-05-22","cited_by_count":19,"area":null},{"id":"2412.09925","title":"Simulating Hard Attention Using Soft Attention","created":"2024-12-13","cited_by_count":15,"area":null},{"id":"2505.23623","title":"Characterizing the Expressivity of Fixed-Precision Transformer Language Models","created":"2025-05-29","cited_by_count":14,"area":null},{"id":"2506.16055","title":"Knee-Deep in C-RASP: A Transformer Depth Hierarchy","created":"2025-06-19","cited_by_count":12,"area":null},{"id":"2503.14615","title":"Unique Hard Attention: A Tale of Two Sides","created":"2025-03-18","cited_by_count":10,"area":null},{"id":"2505.11199","title":"The Counting Power of Transformers","created":"2025-05-16","cited_by_count":9,"area":null},{"id":"2404.02040","title":"Transformers as Transducers","created":"2024-04-02","cited_by_count":8,"area":null},{"id":"2503.16048","title":"Meta-Learning Neural Mechanisms rather than Bayesian Priors","created":"2025-03-20","cited_by_count":8,"area":null},{"id":"2510.00368","title":"The Transformer Cookbook","created":"2025-10-01","cited_by_count":6,"area":null},{"id":"2411.05943","title":"Quantifying artificial intelligence through algorithmic generalization","created":"2024-11-08","cited_by_count":5,"area":null},{"id":"2602.05896","title":"Parity, Sensitivity, and Transformers","created":"2026-02-05","cited_by_count":5,"area":null},{"id":"2510.19315","title":"Transformers are Inherently Succinct","created":"2025-10-22","cited_by_count":4,"area":null},{"id":"2603.02238","title":"Length Generalization Bounds for Transformers","created":"2026-02-13","cited_by_count":4,"area":null},{"id":"2503.11272","title":"When Do Transformers Outperform Feedforward and Recurrent Networks? A Statistical Perspective","created":"2025-03-14","cited_by_count":3,"area":null},{"id":"2605.00768","title":"Characterizing the Expressivity of Local Attention in Transformers","created":"2026-05-01","cited_by_count":3,"area":null},{"id":"2410.06045","title":"Extracting Moore Machines from Transformers using Queries and Counterexamples","created":"2024-10-08","cited_by_count":2,"area":null},{"id":"2508.01067","title":"Expressive Power of Graph Transformers via Logic","created":"2025-08-01","cited_by_count":2,"area":null},{"id":"2510.27118","title":"Probability Distributions Computed by Autoregressive Transformers","created":"2025-10-31","cited_by_count":2,"area":null},{"id":"2601.19467","title":"On the Expressiveness of State Space Models via Temporal Logics","created":"2026-01-27","cited_by_count":2,"area":null},{"id":"2603.19954","title":"On the Ability of Transformers to Verify Plans","created":"2026-03-20","cited_by_count":2,"area":null},{"id":"2407.10949","title":"Representing Rule-based Chatbots with Transformers","created":"2024-07-15","cited_by_count":1,"area":null},{"id":"2503.04848","title":"Three tiers of computation in transformers and in brain architectures","created":"2025-03-05","cited_by_count":1,"area":null},{"id":"2506.18739","title":"On the Existence of Universal Simulators of Attention","created":"2025-06-23","cited_by_count":1,"area":null},{"id":"2509.24024","title":"The Role of Logic and Automata in Understanding Transformers","created":"2025-09-28","cited_by_count":1,"area":null},{"id":"2605.30523","title":"Revisiting Padded Transformer Expressivity: Which Architectural Choices Matter and Which Don't","created":"2026-05-28","cited_by_count":1,"area":null},{"id":"2606.17522","title":"An expressivity analysis of hierarchical modelling in deep transformers via bounded-depth grammars","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2608.11909","title":"Disentangling the Expressivity of RoPE","created":"2026-08-12","cited_by_count":1,"area":null},{"id":"2503.20088","title":"Generative Linguistics, Large Language Models, and the Social Nature of Scientific Success","created":"2025-03-25","cited_by_count":0,"area":null},{"id":"2506.03370","title":"Comparison of different Unique hard attention transformer models by the formal languages they can recognize","created":"2025-06-03","cited_by_count":0,"area":null},{"id":"2602.16473","title":"Synthesis and Verification of Transformer Programs (Technical Report)","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2605.04683","title":"Average Attention Transformers and Arithmetic Circuits","created":"2026-05-06","cited_by_count":0,"area":null},{"id":"2605.07705","title":"Encoder-Decoder Transformers: Logical Characterizations and Periodicity","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.16640","title":"Provably Shorter Scratchpads in Hybrid DeltaNet-Attention Decoders","created":"2026-05-15","cited_by_count":0,"area":null},{"id":"2606.09822","title":"Causally Evaluating the Learnability of Formal Language Tasks","created":"2026-06-08","cited_by_count":0,"area":null},{"id":"2607.26988","title":"A Compositional Theory of Causally Masked Transformers","created":"2026-07-29","cited_by_count":0,"area":null},{"id":"2608.12671","title":"On the Expressive Power of Transformers","created":"2026-08-13","cited_by_count":0,"area":null},{"id":"2608.31067","title":"Universal Transformers for Circuit Computations: Perfect Length Generalization in Tiny Transformers","created":"2026-08-31","cited_by_count":0,"area":null},{"id":"2609.25802","title":"Latest Exact Match Attention","created":"2026-09-22","cited_by_count":0,"area":null},{"id":"2610.02909","title":"Constraint-Aware Training","created":"2026-10-02","cited_by_count":0,"area":null}],"next_cursor":null}