{"total":13,"rows":[{"id":"2505.12629","title":"Enhancing Latent Computation in Transformers with Latent Tokens","created":"2025-05-19","cited_by_count":14,"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":"2410.03001","title":"Can Transformers Learn $n$-gram Language Models?","created":"2024-10-03","cited_by_count":11,"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":"2509.22445","title":"Bridging Kolmogorov Complexity and Deep Learning: Asymptotically Optimal Description Length Objectives for Transformers","created":"2025-09-26","cited_by_count":6,"area":null},{"id":"2502.13953","title":"Benchmarking graph construction by large language models for coherence-driven inference","created":"2025-02-19","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":"2407.10949","title":"Representing Rule-based Chatbots with Transformers","created":"2024-07-15","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":"2505.12381","title":"From n-gram to Attention: How Model Architectures Learn and Propagate Bias in Language Modeling","created":"2025-05-18","cited_by_count":1,"area":null},{"id":"2409.06518","title":"Medal Matters: Probing LLMs' Failure Cases Through Olympic Rankings","created":"2024-09-10","cited_by_count":0,"area":null},{"id":"2605.19514","title":"Position: The Turing-Completeness of Autoregressive Transformers Relies Heavily on Context Management","created":"2026-05-19","cited_by_count":0,"area":null},{"id":"2606.01532","title":"Rethinking the Role of Positional Encoding: Sliding-Window Transformers without PE Remain Turing Complete","created":"2026-06-01","cited_by_count":0,"area":null}],"next_cursor":null}