Constructing a BPE Tokenization DFA
Fuente:
arXiv
Saved in:
| Main Authors: | Berglund, Martin, Martens, Willeke, van der Merwe, Brink |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
MLRegTest: A Benchmark for the Machine Learning of Regular Languages
by: van der Poel, Sam, et al.
Published: (2023)
by: van der Poel, Sam, et al.
Published: (2023)
Deconstructing Subset Construction -- Reducing While Determinizing
by: Nicol, John, et al.
Published: (2025)
by: Nicol, John, et al.
Published: (2025)
Correct and Optimal: the Regular Expression Inference Challenge
by: Valizadeh, Mojtaba, et al.
Published: (2023)
by: Valizadeh, Mojtaba, et al.
Published: (2023)
A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
by: Dhayalkar, Sahil Rajesh
Published: (2025)
by: Dhayalkar, Sahil Rajesh
Published: (2025)
Sampling from Your Language Model One Byte at a Time
by: Hayase, Jonathan, et al.
Published: (2025)
by: Hayase, Jonathan, et al.
Published: (2025)
LLMs as Probabilistic Minimally Adequate Teachers for DFA Learning
by: Chen, Lekai, et al.
Published: (2024)
by: Chen, Lekai, et al.
Published: (2024)
Simulating Hard Attention Using Soft Attention
by: Yang, Andy, et al.
Published: (2024)
by: Yang, Andy, et al.
Published: (2024)
The Expressive Capacity of State Space Models: A Formal Language Perspective
by: Sarrof, Yash, et al.
Published: (2024)
by: Sarrof, Yash, et al.
Published: (2024)
Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues
by: Grazzi, Riccardo, et al.
Published: (2024)
by: Grazzi, Riccardo, et al.
Published: (2024)
Language Models over Canonical Byte-Pair Encodings
by: Vieira, Tim, et al.
Published: (2025)
by: Vieira, Tim, et al.
Published: (2025)
An Algebraic View of the Expressivity of Recurrent Language Models
by: Nowak, Franz, et al.
Published: (2026)
by: Nowak, Franz, et al.
Published: (2026)
From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
by: Hayashi, Katsuhiko, et al.
Published: (2025)
by: Hayashi, Katsuhiko, et al.
Published: (2025)
DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products
by: Siems, Julien, et al.
Published: (2025)
by: Siems, Julien, et al.
Published: (2025)
Bifocal Attention: Harmonizing Geometric and Spectral Positional Embeddings for Algorithmic Generalization
by: Awadhiya, Kanishk
Published: (2026)
by: Awadhiya, Kanishk
Published: (2026)
Unraveling Syntax: How Language Models Learn Context-Free Grammars
by: Schulz, Laura Ying, et al.
Published: (2025)
by: Schulz, Laura Ying, et al.
Published: (2025)
Comparison of different Unique hard attention transformer models by the formal languages they can recognize
by: Ryvkin, Leonid
Published: (2025)
by: Ryvkin, Leonid
Published: (2025)
The Counting Power of Transformers
by: Sälzer, Marco, et al.
Published: (2025)
by: Sälzer, Marco, et al.
Published: (2025)
Tokenization as Finite-State Transduction
by: Cognetta, Marco, et al.
Published: (2024)
by: Cognetta, Marco, et al.
Published: (2024)
Deciding DFA-Primality is NP-Hard
by: Spenner, Daniel Alexander
Published: (2026)
by: Spenner, Daniel Alexander
Published: (2026)
Active Learning of Symbolic Automata Over Rational Numbers
by: Hagedorn, Sebastian, et al.
Published: (2025)
by: Hagedorn, Sebastian, et al.
Published: (2025)
Consistent Autoformalization for Constructing Mathematical Libraries
by: Zhang, Lan, et al.
Published: (2024)
by: Zhang, Lan, et al.
Published: (2024)
Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
by: Dumitru, Radu Cosmin, et al.
Published: (2026)
by: Dumitru, Radu Cosmin, et al.
Published: (2026)
Transformers as Transducers
by: Strobl, Lena, et al.
Published: (2024)
by: Strobl, Lena, et al.
Published: (2024)
Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
by: Okudono, Takamasa, et al.
Published: (2024)
by: Okudono, Takamasa, et al.
Published: (2024)
PDFA Distillation via String Probability Queries
by: Baumgartner, Robert, et al.
Published: (2024)
by: Baumgartner, Robert, et al.
Published: (2024)
Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
by: Chen, Boqi, et al.
Published: (2024)
by: Chen, Boqi, et al.
Published: (2024)
Extending AALpy with Passive Learning: A Generalized State-Merging Approach
by: von Berg, Benjamin, et al.
Published: (2025)
by: von Berg, Benjamin, et al.
Published: (2025)
Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)
by: Kuriyama, Takayuki
Published: (2026)
Learning Reward Machines from Partially Observed Policies
by: Shehab, Mohamad Louai, et al.
Published: (2025)
by: Shehab, Mohamad Louai, et al.
Published: (2025)
Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
by: Li, Tian, et al.
Published: (2025)
by: Li, Tian, et al.
Published: (2025)
SMT-Based Active Learning of Weighted Automata
by: Ferreira, Tiago, et al.
Published: (2026)
by: Ferreira, Tiago, et al.
Published: (2026)
Continuous Diffusion Models Can Obey Formal Syntax
by: Kim, Jinwoo, et al.
Published: (2026)
by: Kim, Jinwoo, et al.
Published: (2026)
Unsupervised Hierarchical Skill Discovery
by: Harvey, Damion, et al.
Published: (2026)
by: Harvey, Damion, et al.
Published: (2026)
Solomonoff induction
by: Sterkenburg, Tom F.
Published: (2026)
by: Sterkenburg, Tom F.
Published: (2026)
Warm Starting State-Space Models with Automata Learning
by: Fishell, William, et al.
Published: (2026)
by: Fishell, William, et al.
Published: (2026)
A Detailed Account of Compositional Automata Learning through Alphabet Refinement
by: Henry, Leo, et al.
Published: (2025)
by: Henry, Leo, et al.
Published: (2025)
Partial Answer of How Transformers Learn Automata
by: Zhang, Tiantian
Published: (2025)
by: Zhang, Tiantian
Published: (2025)
PAC learning PDFA from data streams
by: Baumgartner, Robert, et al.
Published: (2026)
by: Baumgartner, Robert, et al.
Published: (2026)
CoT-TL: Low-Resource Temporal Knowledge Representation of Planning Instructions Using Chain-of-Thought Reasoning
by: Manas, Kumar, et al.
Published: (2024)
by: Manas, Kumar, et al.
Published: (2024)
Imposing Rules in Process Discovery: an Inductive Mining Approach
by: Norouzifar, Ali, et al.
Published: (2024)
by: Norouzifar, Ali, et al.
Published: (2024)
Similar Items
-
MLRegTest: A Benchmark for the Machine Learning of Regular Languages
by: van der Poel, Sam, et al.
Published: (2023) -
Deconstructing Subset Construction -- Reducing While Determinizing
by: Nicol, John, et al.
Published: (2025) -
Correct and Optimal: the Regular Expression Inference Challenge
by: Valizadeh, Mojtaba, et al.
Published: (2023) -
A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
by: Dhayalkar, Sahil Rajesh
Published: (2025) -
Sampling from Your Language Model One Byte at a Time
by: Hayase, Jonathan, et al.
Published: (2025)