{"total":29,"rows":[{"id":"2207.02098","title":"Neural Networks and the Chomsky Hierarchy","created":"2022-07-05","cited_by_count":217,"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":"2107.13163","title":"Statistically Meaningful Approximation: a Case Study on Approximating Turing Machines with Transformers","created":"2021-07-28","cited_by_count":102,"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":"2501.17047","title":"How Linguistics Learned to Stop Worrying and Love the Language Models","created":"2025-01-28","cited_by_count":51,"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":"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":"2410.03170","title":"Autoregressive Large Language Models are Computationally Universal","created":"2024-10-04","cited_by_count":15,"area":null},{"id":"2112.09174","title":"Learning Bounded Context-Free-Grammar via LSTM and the Transformer:Difference and Explanations","created":"2021-12-16","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":"2405.19222","title":"Lower Bounds on the Expressivity of Recurrent Neural Language Models","created":"2024-05-29","cited_by_count":4,"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":"2101.08200","title":"Synthesizing Context-free Grammars from Recurrent Neural Networks (Extended Version)","created":"2021-01-20","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":"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":"2601.08061","title":"Universal computation is intrinsic to language model decoding","created":"2026-01-12","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":"2502.00197","title":"Learning Model Successors","created":"2025-01-31","cited_by_count":0,"area":null},{"id":"2512.09394","title":"Language models as tools for investigating the distinction between possible and impossible natural languages","created":"2025-12-10","cited_by_count":0,"area":null},{"id":"2512.12447","title":"Large language models have learned to use language","created":"2025-12-13","cited_by_count":0,"area":null},{"id":"2512.13441","title":"Large language models are not about natural language","created":"2025-12-15","cited_by_count":0,"area":null},{"id":"2512.14506","title":"Linguists should learn to love speech-based deep learning models","created":"2025-12-16","cited_by_count":0,"area":null},{"id":"2601.10421","title":"Are Language Models Models?","created":"2026-01-15","cited_by_count":0,"area":null},{"id":"2604.09466","title":"Across the Levels of Analysis: Explaining Predictive Processing in Humans Requires More Than Machine-Estimated Probabilities","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2604.09501","title":"You Can't Fight in Here! This is BBS!","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2605.10061","title":"Not-So-Strange Love: Language Models and Generative Linguistic Theories are More Compatible than They Appear","created":"2026-05-11","cited_by_count":0,"area":null}],"next_cursor":null}