Uses of Package
de.learnlib.algorithm.lstar.dfa
-
Packages that use de.learnlib.algorithm.lstar.dfa Package Description de.learnlib.algorithm.lstar.dfa de.learnlib.algorithm.malerpnueli This package (and sub-packages) provides the implementation of theL* variation
based on the paper On the Learnability of Infinitary Regular Sets by Oded Maler and Amir Pnueli.de.learnlib.algorithm.procedural.adapter.dfa de.learnlib.algorithm.rivestschapire This package (and sub-packages) provides the implementation of theL* variation
based on the paper Inference of finite automata using homing sequences by Ronald L. Rivest and Robert E. Schapire. -
Classes in de.learnlib.algorithm.lstar.dfa used by de.learnlib.algorithm.lstar.dfa Class Description ClassicLStarDFA Implementation of the L* algorithm by Dana Angluin.ClassicLStarDFABuilder ExtensibleLStarDFA An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper "Learning Regular Sets from Queries and Counterexamples".ExtensibleLStarDFABuilder -
Classes in de.learnlib.algorithm.lstar.dfa used by de.learnlib.algorithm.malerpnueli Class Description ExtensibleLStarDFA An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper "Learning Regular Sets from Queries and Counterexamples". -
Classes in de.learnlib.algorithm.lstar.dfa used by de.learnlib.algorithm.procedural.adapter.dfa Class Description ClassicLStarDFA Implementation of the L* algorithm by Dana Angluin.ExtensibleLStarDFA An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper "Learning Regular Sets from Queries and Counterexamples". -
Classes in de.learnlib.algorithm.lstar.dfa used by de.learnlib.algorithm.rivestschapire Class Description ExtensibleLStarDFA An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper "Learning Regular Sets from Queries and Counterexamples".