Image de couverture de livre

PDFA Distillation via String Probability Queries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Baumgartner, Robert, Verwer, Sicco
Format:	Preprint
Publié:	2024
Sujets:	Formal Languages and Automata Theory Machine Learning
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

PAC learning PDFA from data streams
par: Baumgartner, Robert, et autres
Publié: (2026)

Database-assisted automata learning
par: Walinga, Hielke, et autres
Publié: (2024)

Analyzing constrained LLM through PDFA-learning
par: Carrasco, Matías, et autres
Publié: (2024)

Learning Deterministic Finite-State Machines from the Prefixes of a Single String is NP-Complete
par: Dumitru, Radu Cosmin, et autres
Publié: (2026)

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

Finite-valued Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2024)

Composing Copyless Streaming String Transducers
par: Alur, Rajeev, et autres
Publié: (2022)

Learning Formal Specifications from Membership and Preference Queries
par: Shah, Ameesh, et autres
Publié: (2023)

Minimizing Streaming String Transducers: An algebraic approach
par: Benalioua, Yahia Idriss, et autres
Publié: (2026)

Transformers as Transducers
par: Strobl, Lena, et autres
Publié: (2024)

Learning Weighted Finite Automata over the Max-Plus Semiring and its Termination
par: Okudono, Takamasa, et autres
Publié: (2024)

Certifying Robustness of Graph Convolutional Networks for Node Perturbation with Polyhedra Abstract Interpretation
par: Chen, Boqi, et autres
Publié: (2024)

Extending AALpy with Passive Learning: A Generalized State-Merging Approach
par: von Berg, Benjamin, et autres
Publié: (2025)

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

Deconstructing Subset Construction -- Reducing While Determinizing
par: Nicol, John, et autres
Publié: (2025)

Learning Reward Machines from Partially Observed Policies
par: Shehab, Mohamad Louai, et autres
Publié: (2025)

Stochastic Alignments: Matching an Observed Trace to Stochastic Process Models
par: Li, Tian, et autres
Publié: (2025)

Active Learning of Symbolic Automata Over Rational Numbers
par: Hagedorn, Sebastian, et autres
Publié: (2025)

SMT-Based Active Learning of Weighted Automata
par: Ferreira, Tiago, et autres
Publié: (2026)

Continuous Diffusion Models Can Obey Formal Syntax
par: Kim, Jinwoo, et autres
Publié: (2026)

Unsupervised Hierarchical Skill Discovery
par: Harvey, Damion, et autres
Publié: (2026)

Solomonoff induction
par: Sterkenburg, Tom F.
Publié: (2026)

Warm Starting State-Space Models with Automata Learning
par: Fishell, William, et autres
Publié: (2026)

A Detailed Account of Compositional Automata Learning through Alphabet Refinement
par: Henry, Leo, et autres
Publié: (2025)

Partial Answer of How Transformers Learn Automata
par: Zhang, Tiantian
Publié: (2025)

Certified Symbolic Finite Transducers: Formalization and Applications to String Analysis
par: Kan, Shuanglong, et autres
Publié: (2025)

A Regular and Complete Notion of Delay for Streaming String Transducers
par: Filiot, Emmanuel, et autres
Publié: (2022)

Query Learning of Advice and Nominal Automata
par: Zhou, Kevin
Publié: (2024)

Chance and Mass Interpretations of Probabilities in Markov Decision Processes (Extended Version)
par: Tsai, Yun Chen, et autres
Publié: (2025)

DeltaProduct: Improving State-Tracking in Linear RNNs via Householder Products
par: Siems, Julien, et autres
Publié: (2025)

Context-Free Languages of String Diagrams
par: Earnshaw, Matt, et autres
Publié: (2024)

TR2MTL: LLM based framework for Metric Temporal Logic Formalization of Traffic Rules
par: Manas, Kumar, et autres
Publié: (2024)

Decision Procedure for A Theory of String Sequences
par: Hu, Denghang, et autres
Publié: (2025)

Simulating Hard Attention Using Soft Attention
par: Yang, Andy, et autres
Publié: (2024)

The Expressive Capacity of State Space Models: A Formal Language Perspective
par: Sarrof, Yash, et autres
Publié: (2024)

Unlocking State-Tracking in Linear RNNs Through Negative Eigenvalues
par: Grazzi, Riccardo, et autres
Publié: (2024)

Constructing a BPE Tokenization DFA
par: Berglund, Martin, et autres
Publié: (2024)

Language Models over Canonical Byte-Pair Encodings
par: Vieira, Tim, et autres
Publié: (2025)

An Algebraic View of the Expressivity of Recurrent Language Models
par: Nowak, Franz, et autres
Publié: (2026)

From Formal Language Theory to Statistical Learning: Finite Observability of Subregular Languages
par: Hayashi, Katsuhiko, et autres
Publié: (2025)