An $\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages

Clemente Pasti, Talu Karagöz, Anej Svete, Franz Nowak, Reda Boumasmoud +1 more
11/9/2024
cs.CL

No confident code implementation found for this paper.

Abstract

Extracting finite state automata (FSAs) from black-box models offers a powerful approach to gaining interpretable insights into complex model behaviors. To support this pursuit, we present a weighted variant of Angluin's (1987) $\mathbf{L^*}$ algorithm for learning FSAs. We stay faithful to the original algorithm, devising a way to exactly learn deterministic weighted FSAs whose weights support division. Furthermore, we formulate the learning process in a manner that highlights the connection with FSA minimization, showing how $\mathbf{L^*}$ directly learns a minimal automaton for the target language.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{pasti2024mathbfl,
  title  = {An $\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages},
  author = {Clemente Pasti and Talu Karagöz and Anej Svete and Franz Nowak and Reda Boumasmoud and Ryan Cotterell},
  year   = {2024},
  eprint = {2411.06228},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.06228v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.06228.svg)](https://codeofpaper.com/paper/2411.06228)

Discussion