Modifier and Type | Class and Description |
---|---|
class |
BaselineLStar<I>
Implementation of the L* algorithm by Dana Angluin
|
Modifier and Type | Class and Description |
---|---|
class |
MealyDHC<I,O> |
Modifier and Type | Interface and Description |
---|---|
static interface |
GlobalSuffixLearner.GlobalSuffixLearnerDFA<I> |
static interface |
GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP>>
Abstract base class for algorithms that produce (subclasses of)
MutableDeterministic
automata. |
class |
AbstractLStar<A,I,D>
An abstract base class for L*-style algorithms.
|
class |
ExtensibleAutomatonLStar<A,I,D,S,T,SP,TP,AI extends MutableDeterministic<S,I,T,SP,TP>> |
Modifier and Type | Class and Description |
---|---|
class |
ExtensibleLStarDFA<I>
An implementation of Angluin's L* algorithm for learning DFAs, as described in the paper
"Learning Regular Sets from Queries and Counterexamples".
|
Modifier and Type | Class and Description |
---|---|
class |
ClassicLStarMealy<I,O>
An implementation of the L*Mealy algorithm for inferring Mealy machines, as described
by Oliver Niese in his Ph.D. thesis.
|
class |
ExtensibleLStarMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
MalerPnueliDFA<I> |
class |
MalerPnueliMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
RivestSchapireDFA<I> |
class |
RivestSchapireMealy<I,O> |
Copyright © 2015. All rights reserved.