Cover Image

Deconstructing Subset Construction -- Reducing While Determinizing

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Nicol, John, Frohme, Markus
Format:	Preprint
Published:	2025
Subjects:	Formal Languages and Automata Theory Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Close Analysis of the Subset Construction
by: Baburin, Ivan, et al.
Published: (2024)

A Constructive Framework for Nondeterministic Automata via Time-Shared, Depth-Unrolled Feedforward Networks
by: Dhayalkar, Sahil Rajesh
Published: (2025)

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

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
by: von Berg, Benjamin, et al.
Published: (2025)

Learning Reward Machines from Partially Observed Policies
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)

Active Learning of Symbolic Automata Over Rational Numbers
by: Hagedorn, Sebastian, et al.
Published: (2025)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
by: Henry, Leo, et al.
Published: (2025)

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

Finite Sentence-Interface Control for Learning Bounded-Fan-Out Linear MCFGs under Fixed Monoid Typing
by: Kuriyama, Takayuki
Published: (2026)

Transformers as Transducers
by: Strobl, Lena, 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)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
by: Okudono, Takamasa, et al.
Published: (2024)

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

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

Unsupervised Hierarchical Skill Discovery
by: Harvey, Damion, et al.
Published: (2026)

PDFA Distillation via String Probability Queries
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)

Solomonoff induction
by: Sterkenburg, Tom F.
Published: (2026)

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

PAC learning PDFA from data streams
by: Baumgartner, Robert, et al.
Published: (2026)

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

Determinism in Multi-Soliton Automata
by: Bordihn, Henning, et al.
Published: (2024)

Neural Networks as Universal Finite-State Machines: A Constructive Deterministic Finite Automaton Theory
by: Dhayalkar, Sahil Rajesh
Published: (2025)

A General Information Extraction Framework Based on Formal Languages
by: Schmid, Markus L.
Published: (2025)

The Power-Set Construction for Tree Algebras
by: Blumensath, Achim
Published: (2022)

Checking History-Determinism is NP-hard for Parity Automata
by: Prakash, Keya
Published: (2023)

Efficient Constructions of Finite-State Independent Normal Pairs
by: Pulari, Subin
Published: (2026)

TR2MTL: LLM based framework for Metric Temporal Logic Formalization of Traffic Rules
by: Manas, Kumar, et al.
Published: (2024)

Constructing Concise Characteristic Samples for Acceptors of Omega Regular Languages
by: Angluin, Dana, et al.
Published: (2022)

Constructing Deterministic Parity Automata from Positive and Negative Examples
by: Bohn, León, et al.
Published: (2023)

Efficient Construction of Reachability Graphs for Petri Net Product Lines
by: Gómez-Martínez, Elena, et al.
Published: (2026)

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

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

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

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

Unraveling Syntax: How Language Models Learn Context-Free Grammars
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)

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)