{"total":62,"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":"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":"2105.11115","title":"Self-Attention Networks Can Process Bounded Hierarchical Languages","created":"2021-05-24","cited_by_count":105,"area":null},{"id":"2411.12537","title":"Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues","created":"2024-11-19","cited_by_count":101,"area":"ssm"},{"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":"2412.05149","title":"Findings of the Second BabyLM Challenge: Sample-Efficient Pretraining on Developmentally Plausible Corpora","created":"2024-12-06","cited_by_count":48,"area":null},{"id":"2305.14701","title":"Modeling rapid language learning by distilling Bayesian priors into artificial neural networks","created":"2023-05-24","cited_by_count":42,"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":"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":"2410.09087","title":"Mechanistic?","created":"2024-10-07","cited_by_count":25,"area":"mechinterp"},{"id":"2411.07107","title":"Training Neural Networks as Recognizers of Formal Languages","created":"2024-11-11","cited_by_count":24,"area":"lr"},{"id":"2502.07827","title":"Implicit Language Models are RNNs: Balancing Parallelization and Expressivity","created":"2025-02-10","cited_by_count":22,"area":"lr"},{"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":"2305.19044","title":"Exploring the Promise and Limits of Real-Time Recurrent Learning","created":"2023-05-30","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":"2402.10013","title":"Bridging the Empirical-Theoretical Gap in Neural Network Formal Language Learning Using Minimum Description Length","created":"2024-02-15","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":"2506.10918","title":"Sequential-Parallel Duality in Prefix Scannable Models","created":"2025-06-12","cited_by_count":8,"area":"ssm"},{"id":"2508.08435","title":"Fast weight programming and linear transformers: from machine learning to neurobiology","created":"2025-08-11","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":"2211.16429","title":"Exploring the Long-Term Generalization of Counting Behavior in RNNs","created":"2022-11-29","cited_by_count":7,"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":"2503.01544","title":"Compositional Reasoning with Transformers, RNNs, and Chain of Thought","created":"2025-03-03","cited_by_count":6,"area":"lr"},{"id":"2602.14814","title":"Learning State-Tracking from Code Using Linear RNNs","created":"2026-02-16","cited_by_count":6,"area":null},{"id":"2205.02724","title":"Implicit N-grams Induced by Recurrence","created":"2022-05-05","cited_by_count":4,"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":"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.19315","title":"Transformers are Inherently Succinct","created":"2025-10-22","cited_by_count":4,"area":null},{"id":"2106.02965","title":"Extracting Weighted Automata for Approximate Minimization in Language Modelling","created":"2021-06-05","cited_by_count":3,"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":"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":"2406.05045","title":"A Tensor Decomposition Perspective on Second-order RNNs","created":"2024-06-07","cited_by_count":3,"area":null},{"id":"2605.10129","title":"Synthetic Pre-Pre-Training Improves Language Model Robustness to Noisy Pre-Training Data","created":"2026-05-11","cited_by_count":3,"area":null},{"id":"2209.10818","title":"Memory-Augmented Graph Neural Networks: A Brain-Inspired Review","created":"2022-09-22","cited_by_count":2,"area":null},{"id":"2505.24110","title":"A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks","created":"2025-05-30","cited_by_count":2,"area":null},{"id":"2108.10692","title":"Generalized Optimal Linear Orders","created":"2021-08-13","cited_by_count":1,"area":null},{"id":"2307.06005","title":"DDNAS: Discretized Differentiable Neural Architecture Search for Text Classification","created":"2023-07-12","cited_by_count":1,"area":null},{"id":"2309.17032","title":"Refined Kolmogorov Complexity of Analog, Evolving and Stochastic Recurrent Neural Networks","created":"2023-09-29","cited_by_count":1,"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":"2312.09048","title":"On The Expressivity of Recurrent Neural Cascades","created":"2023-12-14","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":"2506.18739","title":"On the Existence of Universal Simulators of Attention","created":"2025-06-23","cited_by_count":1,"area":null},{"id":"2509.02491","title":"RNN Generalization to Omega-Regular Languages","created":"2025-09-02","cited_by_count":1,"area":null},{"id":"2601.08061","title":"Universal computation is intrinsic to language model decoding","created":"2026-01-12","cited_by_count":1,"area":null},{"id":"2603.05573","title":"Why Depth Matters in Parallelizable Sequence Models: A Lie Algebraic View","created":"2026-03-05","cited_by_count":1,"area":"ssm"},{"id":"2604.14501","title":"On the Expressive Power and Limitations of Multi-Layer SSMs","created":"2026-04-16","cited_by_count":1,"area":"lr"},{"id":"2605.26035","title":"Length Generalization with Log-Depth Recurrent Units","created":"2026-05-25","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":"2305.05531","title":"Modelling Concurrency Bugs Using Machine Learning","created":"2023-05-08","cited_by_count":0,"area":null},{"id":"2305.09178","title":"Empirical Analysis of the Inductive Bias of Recurrent Neural Networks by Discrete Fourier Transform of Output Sequences","created":"2023-05-16","cited_by_count":0,"area":null},{"id":"2310.16350","title":"Unraveling Feature Extraction Mechanisms in Neural Networks","created":"2023-10-25","cited_by_count":0,"area":null},{"id":"2405.11657","title":"On the Expressivity of Recurrent Neural Cascades with Identity","created":"2024-05-19","cited_by_count":0,"area":null},{"id":"2410.03118","title":"Precision, Stability, and Generalization: A Comprehensive Assessment of RNNs learnability capability for Classifying Counter and Dyck Languages","created":"2024-10-04","cited_by_count":0,"area":null},{"id":"2410.03154","title":"Exploring Learnability in Memory-Augmented Recurrent Neural Networks: Precision, Stability, and Empirical Insights","created":"2024-10-04","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":"2604.02201","title":"On the Role of Depth in the Expressivity of RNNs","created":"2026-04-02","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":"2610.04569","title":"From Transformers to Weighted Automata: Towards the Verification of Large Language Models","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}