:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Schulz, Laura Ying, Mitropolsky, Daniel, Poggio, Tomaso
Format:	Preprint
Published:	2025
Subjects:	Computation and Language Formal Languages and Automata Theory Machine Learning
Online Access:	https://arxiv.org/abs/2510.02524
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Forbidden-Context & Ordered Grammar Systems
by: Fernau, Henning, et al.
Published: (2026)

Constrained Decoding of Diffusion LLMs with Context-Free Grammars
by: Mündler, Niels, et al.
Published: (2025)

Continuous Diffusion Models Can Obey Formal Syntax
by: Kim, Jinwoo, et al.
Published: (2026)

Detecting and Explaining (In-)equivalence of Context-Free Grammars
by: Schmellenkamp, Marko, et al.
Published: (2024)

Context-Free Recognition with Transformers
by: Jerad, Selim, et al.
Published: (2026)

Passive Model Learning of Visibly Deterministic Context-free Grammars
by: Muškardin, Edi, et al.
Published: (2025)

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
by: Hayashi, Katsuhiko, et al.
Published: (2025)

Directed Regular and Context-Free Languages
by: Ganardi, Moses, et al.
Published: (2024)

An Algebraic View of the Expressivity of Recurrent Language Models
by: Nowak, Franz, et al.
Published: (2026)

MLRegTest: A Benchmark for the Machine Learning of Regular Languages
by: van der Poel, Sam, et al.
Published: (2023)

Language Models over Canonical Byte-Pair Encodings
by: Vieira, Tim, et al.
Published: (2025)

Sampling from Your Language Model One Byte at a Time
by: Hayase, Jonathan, et al.
Published: (2025)

The Expressive Capacity of State Space Models: A Formal Language Perspective
by: Sarrof, Yash, et al.
Published: (2024)

Partial Answer of How Transformers Learn Automata
by: Zhang, Tiantian
Published: (2025)

Syntax Repair as Language Intersection
by: Considine, Breandan
Published: (2025)

A Lower Bound on Unambiguous Context Free Grammars via Communication Complexity
by: Mengel, Stefan, et al.
Published: (2024)

Idefix-Closed Languages and Their Application in Contextual Grammars
by: Ködding, Marvin, et al.
Published: (2025)

Computational Model for Parsing Expression Grammars
by: Rubtsov, Alexander, et al.
Published: (2024)

Bonding Grammars
by: Pshenitsyn, Tikhon
Published: (2024)

SynCode: LLM Generation with Grammar Augmentation
by: Ugare, Shubham, et al.
Published: (2024)

Distributional Learning of Context-Free Languages under Fixed Finite-Monoid Typing
by: Kuriyama, Takayuki
Published: (2014)

Warm Starting State-Space Models with Automata Learning
by: Fishell, William, et al.
Published: (2026)

DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products
by: Siems, Julien, et al.
Published: (2025)

Comparison of different Unique hard attention transformer models by the formal languages they can recognize
by: Ryvkin, Leonid
Published: (2025)

The Counting Power of Transformers
by: Sälzer, Marco, et al.
Published: (2025)

Simulating Hard Attention Using Soft Attention
by: Yang, Andy, et al.
Published: (2024)

Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues
by: Grazzi, Riccardo, et al.
Published: (2024)

Bifocal Attention: Harmonizing Geometric and Spectral Positional Embeddings for Algorithmic Generalization
by: Awadhiya, Kanishk
Published: (2026)

Constructing a BPE Tokenization DFA
by: Berglund, Martin, et al.
Published: (2024)

Correct and Optimal: the Regular Expression Inference Challenge
by: Valizadeh, Mojtaba, et al.
Published: (2023)

Language Generation: Complexity Barriers and Implications for Learning
by: Arenas, Marcelo, et al.
Published: (2025)

A Tree Sampler for Bounded Context-Free Languages
by: Considine, Breandan
Published: (2024)

Shuffles of Context-Free Languages along Regular Trajectories
by: Barloy, Corentin, et al.
Published: (2026)

Masked Hard-Attention Transformers Recognize Exactly the Star-Free Languages
by: Yang, Andy, et al.
Published: (2023)

Tahr: The Generative Attribute Grammar Framework
by: Ciccaglione, Matteo, et al.
Published: (2025)

On Decidability and Expressive Power of Fusion Grammars
by: Pshenitsyn, Tikhon
Published: (2023)

$L^*LM$: Learning Automata from Examples using Natural Language Oracles
by: Vazquez-Chanlatte, Marcell, et al.
Published: (2024)

Closure Properties of General Grammars -- Formally Verified
by: Dvorak, Martin, et al.
Published: (2023)

SMT-Based Active Learning of Weighted Automata
by: Ferreira, Tiago, et al.
Published: (2026)

Learning Reward Machines from Partially Observed Policies
by: Shehab, Mohamad Louai, et al.
Published: (2025)