Diversity-based Inference of Finite Automata
We present a new procedure for inferring the structure of a finite-state automaton (FSA) from its input/output behavior, using access to the automaton to perform experiments. Our procedure uses a new representation for FSA's, based on the notion of equivalence between tests.
| מחבר ראשי: | |
|---|---|
| מחברים אחרים: | |
| יצא לאור: |
2023
|
| גישה מקוונת: | https://hdl.handle.net/1721.1/149670 |