Package 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.

Class Summary

Class	Description
AbstractAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP> & SupportsGrowingAlphabet<I>>	Abstract base class for algorithms that produce (subclasses of) MutableDeterministic automata.
AbstractExtensibleAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP> & SupportsGrowingAlphabet<I>>
AbstractExtensibleAutomatonLStar.BuilderDefaults
AbstractLStar<A,I,D>	An abstract base class for L*-style algorithms.
AutomatonLStarState<I,D,AI,S>	Class that contains all data that represent the internal state of the AbstractAutomatonLStar learner and its DFA and Mealy implementations.