LearnLib :: Algorithms :: L* 0.17.0 API
| Package | Description |
|---|---|
| de.learnlib.algorithm.lstar |
This package (and sub-packages) provides the implementation of the L* learning algorithm described in the paper
Learning Regular Sets from Queries and Counterexamples by
Dana Angluin as well as multiple variations thereof.
|
| de.learnlib.algorithm.lstar.ce | |
| de.learnlib.algorithm.lstar.closing | |
| de.learnlib.algorithm.lstar.dfa | |
| de.learnlib.algorithm.lstar.mealy | |
| de.learnlib.algorithm.lstar.moore | |
| de.learnlib.algorithm.malerpnueli |
This package (and sub-packages) provides the implementation of the
L* variation
based on the paper On the Learnability of Infinitary Regular
Sets by Oded Maler and Amir Pnueli. |
| de.learnlib.algorithm.rivestschapire |
This package (and sub-packages) provides the implementation of the
L* variation
based on the paper Inference of finite automata using homing
sequences by Ronald L. Rivest and Robert E. Schapire. |