{"total":49,"rows":[{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"area":null},{"id":"2402.01032","title":"Repeat After Me: Transformers are Better than State Space Models at Copying","created":"2024-02-01","cited_by_count":216,"area":null},{"id":"2404.08819","title":"The Illusion of State in State-Space Models","created":"2024-04-12","cited_by_count":187,"area":null},{"id":"2106.06981","title":"Thinking Like Transformers","created":"2021-06-13","cited_by_count":184,"area":null},{"id":"2106.16213","title":"Saturated Transformers are Constant-Depth Threshold Circuits","created":"2021-06-30","cited_by_count":139,"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":"2401.12973","title":"In-Context Language Learning: Architectures and Algorithms","created":"2024-01-23","cited_by_count":89,"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":"2401.06416","title":"Mission: Impossible Language Models","created":"2024-01-12","cited_by_count":32,"area":null},{"id":"2404.14994","title":"Transformers Can Represent $n$-gram Language Models","created":"2024-04-23","cited_by_count":32,"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":"2104.10343","title":"Sensitivity as a Complexity Measure for Sequence Classification Tasks","created":"2021-04-21","cited_by_count":28,"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":"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":"2109.12036","title":"Transformers Generalize Linearly","created":"2021-09-24","cited_by_count":19,"area":null},{"id":"2201.12451","title":"Extracting Finite Automata from RNNs Using State Merging","created":"2022-01-28","cited_by_count":17,"area":null},{"id":"2403.11998","title":"Learning Useful Representations of Recurrent Neural Network Weight Matrices","created":"2024-03-18","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":"2102.10094","title":"Formal Language Theory Meets Modern NLP","created":"2021-02-19","cited_by_count":9,"area":null},{"id":"2309.14691","title":"On the Computational Complexity and Formal Hierarchy of Second Order Recurrent Neural Networks","created":"2023-09-26","cited_by_count":8,"area":null},{"id":"2603.03612","title":"Why Are Linear RNNs More Parallelizable?","created":"2026-03-04","cited_by_count":8,"area":null},{"id":"2603.14360","title":"M$^2$RNN: Non-Linear RNNs with Matrix-Valued States for Scalable Language Modeling","created":"2026-03-15","cited_by_count":8,"area":null},{"id":"2310.05161","title":"Recurrent Neural Language Models as Probabilistic Finite-state Automata","created":"2023-10-08","cited_by_count":6,"area":null},{"id":"2106.01580","title":"The Limitations of Limited Context for Constituency Parsing","created":"2021-06-03","cited_by_count":5,"area":null},{"id":"2205.02724","title":"Implicit N-grams Induced by Recurrence","created":"2022-05-05","cited_by_count":4,"area":null},{"id":"2310.14211","title":"LUNA: A Model-Based Universal Analysis Framework for Large Language Models","created":"2023-10-22","cited_by_count":4,"area":null},{"id":"2405.19222","title":"Lower Bounds on the Expressivity of Recurrent Neural Language Models","created":"2024-05-29","cited_by_count":4,"area":null},{"id":"2510.02524","title":"Unraveling Syntax: Language Modeling and the Substructure of Grammars","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2304.03639","title":"Theoretical Conditions and Empirical Failure of Bracket Counting on Long Sequences with Linear Recurrent Networks","created":"2023-04-07","cited_by_count":3,"area":null},{"id":"2406.05045","title":"A Tensor Decomposition Perspective on Second-order RNNs","created":"2024-06-07","cited_by_count":3,"area":null},{"id":"2408.02999","title":"LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning","created":"2024-08-06","cited_by_count":3,"area":null},{"id":"2505.10606","title":"Continuity and Isolation Lead to Doubts or Dilemmas in Large Language Models","created":"2025-05-15","cited_by_count":3,"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":"2606.01765","title":"An Algebraic View of the Expressivity of Recurrent Language Models","created":"2026-06-01","cited_by_count":2,"area":null},{"id":"2310.12942","title":"On the Representational Capacity of Recurrent Neural Language Models","created":"2023-10-19","cited_by_count":1,"area":null},{"id":"2402.15814","title":"On Efficiently Representing Regular Languages as RNNs","created":"2024-02-24","cited_by_count":1,"area":null},{"id":"2411.06228","title":"An $\\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages","created":"2024-11-09","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":"2511.22751","title":"Exact Learning of Arithmetic with Differentiable Agents","created":"2025-11-27","cited_by_count":1,"area":null},{"id":"2606.12364","title":"On Subquadratic Architectures: From Applications to Principles","created":"2026-06-10","cited_by_count":1,"area":null},{"id":"2106.00047","title":"Learning and Generalization in RNNs","created":"2021-05-31","cited_by_count":0,"area":null},{"id":"2303.06841","title":"Learning Transductions and Alignments with RNN Seq2seq Models","created":"2023-03-13","cited_by_count":0,"area":null},{"id":"2402.06966","title":"DeepCover: Advancing RNN Test Coverage and Online Error Prediction using State Machine Extraction","created":"2024-02-10","cited_by_count":0,"area":null},{"id":"2502.00197","title":"Learning Model Successors","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2604.01228","title":"Logic-Gated Time-Shared Feedforward Networks for Alternating Finite Automata: Exact Simulation and Learnability","created":"2026-03-20","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.06155","title":"When Does Tool Use Increase the Expressive Power of Finite-Precision Recurrent Models?","created":"2026-07-07","cited_by_count":0,"area":null}],"next_cursor":null}