Module de.learnlib.algorithm.lstar

This module provides the implementation of the L* learning algorithm described in the paper Learning Regular Sets from Queries and Counterexamples by Dana Angluin including variations and optimizations thereof such as the versions based on "On the Learnability of Infinitary Regular Sets by Oded Maler and Amir Pnueli or Inference of finite automata using homing sequences) by Ronald L. Rivest and Robert E. Schapire.

This module is provided by the following Maven dependency:

 <dependency>
   <groupId>de.learnlib</groupId>
   <artifactId>learnlib-lstar</artifactId>
   <version>${version}</version>
 </dependency>
 

Packages

Package	Exported To Modules	Opened To Modules	Description
de.learnlib.algorithm.lstar	All Modules	All Modules
de.learnlib.algorithm.lstar.ce	All Modules	All Modules
de.learnlib.algorithm.lstar.closing	All Modules	All Modules
de.learnlib.algorithm.lstar.dfa	All Modules	All Modules
de.learnlib.algorithm.lstar.mealy	All Modules	All Modules
de.learnlib.algorithm.lstar.moore	All Modules	All Modules
de.learnlib.algorithm.malerpnueli	All Modules	All Modules
de.learnlib.algorithm.rivestschapire	All Modules	All Modules