Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2411.06228 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915070823366656 |
|---|---|
| author | Pasti, Clemente Karagöz, Talu Svete, Anej Nowak, Franz Boumasmoud, Reda Cotterell, Ryan |
| author_facet | Pasti, Clemente Karagöz, Talu Svete, Anej Nowak, Franz Boumasmoud, Reda Cotterell, Ryan |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_06228 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | An $\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages Pasti, Clemente Karagöz, Talu Svete, Anej Nowak, Franz Boumasmoud, Reda Cotterell, Ryan Computation and Language 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. |
| title | An $\mathbf{L^*}$ Algorithm for Deterministic Weighted Regular Languages |
| topic | Computation and Language |
| url | https://arxiv.org/abs/2411.06228 |