{"total":51,"rows":[{"id":"2210.10749","title":"Transformers Learn Shortcuts to Automata","created":"2022-10-19","cited_by_count":268,"area":null},{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"area":null},{"id":"2310.16028","title":"What Algorithms can Transformers Learn? A Study in Length Generalization","created":"2023-10-24","cited_by_count":199,"area":null},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":184,"area":null},{"id":"2311.00208","title":"What Formal Languages Can Transformers Express? A Survey","created":"2023-11-01","cited_by_count":124,"area":null},{"id":"2305.16843","title":"Randomized Positional Encodings Boost Length Generalization of Transformers","created":"2023-05-26","cited_by_count":117,"area":null},{"id":"2105.11115","title":"Self-Attention Networks Can Process Bounded Hierarchical Languages","created":"2021-05-24","cited_by_count":105,"area":null},{"id":"2303.04245","title":"How Do Transformers Learn Topic Structure: Towards a Mechanistic Understanding","created":"2023-03-07","cited_by_count":86,"area":null},{"id":"2211.12316","title":"Simplicity Bias in Transformers and their Ability to Learn Sparse Boolean Functions","created":"2022-11-22","cited_by_count":70,"area":null},{"id":"2403.01632","title":"SynCode: LLM Generation with Grammar Augmentation","created":"2024-03-03","cited_by_count":69,"area":null},{"id":"2310.03016","title":"Understanding In-Context Learning in Transformers and LLMs by Learning to Learn Discrete Functions","created":"2023-10-04","cited_by_count":63,"area":null},{"id":"2402.08164","title":"On Limitations of the Transformer Architecture","created":"2024-02-13","cited_by_count":63,"area":null},{"id":"2310.13897","title":"Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages","created":"2023-10-21","cited_by_count":49,"area":null},{"id":"2412.02975","title":"Theoretical limitations of multi-layer Transformer","created":"2024-12-04","cited_by_count":45,"area":null},{"id":"2304.13276","title":"The Closeness of In-Context Learning and Weight Shifting for Softmax Regression","created":"2023-04-26","cited_by_count":41,"area":null},{"id":"2410.02984","title":"Differentiation and Specialization of Attention Heads via the Refined Local Learning Coefficient","created":"2024-10-03","cited_by_count":40,"area":null},{"id":"2504.09246","title":"Type-Constrained Code Generation with Language Models","created":"2025-04-12","cited_by_count":35,"area":null},{"id":"2401.06416","title":"Mission: Impossible Language Models","created":"2024-01-12","cited_by_count":32,"area":null},{"id":"2310.15746","title":"Failures Pave the Way: Enhancing Large Language Models through Tuning-free Rule Accumulation","created":"2023-10-24","cited_by_count":30,"area":null},{"id":"2312.01429","title":"Transformers are uninterpretable with myopic methods: a case study with bounded Dyck grammars","created":"2023-12-03","cited_by_count":30,"area":null},{"id":"2306.02295","title":"A Mathematical Abstraction for Balancing the Trade-off Between Creativity and Reality in Large Language Models","created":"2023-06-04","cited_by_count":29,"area":null},{"id":"2406.09347","title":"Separations in the Representational Capabilities of Transformers and Recurrent Architectures","created":"2024-06-13","cited_by_count":29,"area":null},{"id":"2312.03656","title":"Interpretability Illusions in the Generalization of Simplified Models","created":"2023-12-06","cited_by_count":25,"area":null},{"id":"2405.20131","title":"Language Models Need Inductive Biases to Count Inductively","created":"2024-05-30","cited_by_count":25,"area":null},{"id":"2411.07107","title":"Training Neural Networks as Recognizers of Formal Languages","created":"2024-11-11","cited_by_count":24,"area":"lr"},{"id":"2502.12317","title":"Can Language Models Learn Typologically Implausible Languages?","created":"2025-02-17","cited_by_count":23,"area":null},{"id":"2310.16076","title":"Practical Computational Power of Linear Transformers and Their Recurrent and Self-Referential Extensions","created":"2023-10-24","cited_by_count":20,"area":null},{"id":"2406.04289","title":"What Languages are Easy to Language-Model? A Perspective from Learning Probabilistic Regular Languages","created":"2024-06-06","cited_by_count":20,"area":null},{"id":"2310.11685","title":"Why Softmax Attention Outperforms Linear Attention","created":"2023-10-18","cited_by_count":15,"area":null},{"id":"2401.12947","title":"Transformer-Based Models Are Not Yet Perfect At Learning to Emulate Structural Recursion","created":"2024-01-23","cited_by_count":14,"area":null},{"id":"2508.10111","title":"Constrained Decoding of Diffusion LLMs with Context-Free Grammars","created":"2025-08-13","cited_by_count":14,"area":null},{"id":"2502.12123","title":"On the Query Complexity of Verifier-Assisted Language Generation","created":"2025-02-17","cited_by_count":12,"area":"lr"},{"id":"2306.12181","title":"Feature Interactions Reveal Linguistic Structure in Language Models","created":"2023-06-21","cited_by_count":8,"area":null},{"id":"2507.06445","title":"Can Interpretation Predict Behavior on Unseen Data?","created":"2025-07-08","cited_by_count":8,"area":null},{"id":"2304.07687","title":"MLRegTest: A Benchmark for the Machine Learning of Regular Languages","created":"2023-04-16","cited_by_count":7,"area":null},{"id":"2410.18077","title":"ALTA: Compiler-Based Analysis of Transformers","created":"2024-10-23","cited_by_count":7,"area":null},{"id":"2403.09728","title":"Simulating Weighted Automata over Sequences and Trees with Transformers","created":"2024-03-12","cited_by_count":4,"area":null},{"id":"2407.13594","title":"Validating Mechanistic Interpretations: An Axiomatic Approach","created":"2024-07-18","cited_by_count":4,"area":"mechinterp"},{"id":"2601.01754","title":"Context-Free Recognition with Transformers","created":"2026-01-05","cited_by_count":4,"area":null},{"id":"2306.17184","title":"State space models can express n-gram languages","created":"2023-06-20","cited_by_count":3,"area":null},{"id":"2402.02627","title":"Stability Analysis of Various Symbolic Rule Extraction Methods from Recurrent Neural Network","created":"2024-02-04","cited_by_count":3,"area":null},{"id":"2210.07703","title":"Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence","created":"2022-10-14","cited_by_count":2,"area":null},{"id":"2309.00857","title":"Evaluating Transformer's Ability to Learn Mildly Context-Sensitive Languages","created":"2023-09-02","cited_by_count":2,"area":null},{"id":"2405.04515","title":"A Transformer with Stack Attention","created":"2024-05-07","cited_by_count":2,"area":null},{"id":"2512.09757","title":"Circuits, Features, and Heuristics in Molecular Transformers","created":"2025-12-10","cited_by_count":2,"area":"mechinterp"},{"id":"2306.16951","title":"Applying language models to algebraic topology: generating simplicial cycles using multi-labeling in Wu's formula","created":"2023-06-01","cited_by_count":1,"area":null},{"id":"2505.10719","title":"Tracr-Injection: Distilling Algorithms into Pre-trained Language Models","created":"2025-05-15","cited_by_count":1,"area":null},{"id":"2502.00197","title":"Learning Model Successors","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2510.18634","title":"Hardness of Learning Regular Languages in the Next Symbol Prediction Setting","created":"2025-10-21","cited_by_count":0,"area":null},{"id":"2607.10268","title":"Language Re-generation: An investigation into information locality effects on reconstruction","created":"2026-07-11","cited_by_count":0,"area":null},{"id":"2607.20483","title":"Tractable Hierarchical Control of Autoregressive Language Models","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}