Papers by Reda Boumasmoud
An L* Algorithm for Deterministic Weighted Regular Languages (2024.emnlp-main)
Copied to clipboard
| Challenge: | Angluin (1987) introduced the active learning scheme L , where the learner interacts with an oracle by asking it queries. |
| Approach: | They propose a weighted variant of Angluin's (1987) L* algorithm for learning finite state automatas from black-box models. |
| Outcome: | The proposed algorithm learns aminimal automaton for the target language. |