Modifier and Type | Class and Description |
---|---|
class |
ADTLearner<I,O>
The main learning algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
MealyDHC<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractDTLearner<M extends net.automatalib.automata.concepts.SuffixOutput<I,D>,I,D,SP,TP> |
Modifier and Type | Class and Description |
---|---|
class |
DTLearnerDFA<I>
Algorithm for learning DFA using the Discrimination Tree algorithm.
|
Modifier and Type | Class and Description |
---|---|
class |
DTLearnerMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractVPDALearner<I> |
class |
DTLearnerVPDA<I> |
Modifier and Type | Class and Description |
---|---|
class |
KearnsVaziraniDFA<I>
The Kearns/Vazirani algorithm for learning DFA, as described in the book "An Introduction to Computational Learning
Theory" by Michael Kearns and Umesh Vazirani.
|
Modifier and Type | Class and Description |
---|---|
class |
KearnsVaziraniMealy<I,O>
An adaption of the Kearns/Vazirani algorithm for Mealy machines.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractAutomatonLStar<A,I,D,S,T,SP,TP,AI extends net.automatalib.automata.MutableDeterministic<S,I,T,SP,TP> & net.automatalib.automata.GrowableAlphabetAutomaton<I>>
Abstract base class for algorithms that produce (subclasses of)
MutableDeterministic automata. |
class |
AbstractExtensibleAutomatonLStar<A,I,D,S,T,SP,TP,AI extends net.automatalib.automata.MutableDeterministic<S,I,T,SP,TP> & net.automatalib.automata.GrowableAlphabetAutomaton<I>> |
class |
AbstractLStar<A,I,D>
An abstract base class for L*-style algorithms.
|
Modifier and Type | Class and Description |
---|---|
class |
ClassicLStarDFA<I>
Implementation of the L* algorithm by Dana Angluin.
|
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.
|
class |
ExtensibleLStarMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
MalerPnueliDFA<I> |
class |
MalerPnueliMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
NLStarLearner<I>
The NL* algorithm, as described in the paper "Angluin-Style
Learning of NFA" by B.
|
Modifier and Type | Class and Description |
---|---|
class |
RivestSchapireDFA<I> |
class |
RivestSchapireMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractTTTLearner<A,I,D>
The TTT learning algorithm for
DFA . |
Modifier and Type | Class and Description |
---|---|
class |
PrefixTTTLearnerDFA<I> |
class |
TTTLearnerDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
TTTLearnerMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
TTTLearnerVPDA<I> |
Modifier and Type | Interface and Description |
---|---|
static interface |
LearningAlgorithm.DFALearner<I> |
static interface |
LearningAlgorithm.MealyLearner<I,O> |
interface |
NFALearner<I> |
Modifier and Type | Interface and Description |
---|---|
interface |
GlobalSuffixLearner<M,I,D>
Common interface for learning algorithms that use a global suffix set.
|
static interface |
GlobalSuffixLearner.GlobalSuffixLearnerDFA<I> |
static interface |
GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O> |
Modifier and Type | Interface and Description |
---|---|
interface |
OTLearner<M,I,D> |
static interface |
OTLearner.OTLearnerDFA<I> |
static interface |
OTLearner.OTLearnerMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractGrowingAlphabetDFATest<L extends SupportsGrowingAlphabet<Character> & LearningAlgorithm<net.automatalib.automata.fsa.DFA<?,Character>,Character,Boolean>> |
class |
AbstractGrowingAlphabetMealyTest<L extends SupportsGrowingAlphabet<Character> & LearningAlgorithm<net.automatalib.automata.transout.MealyMachine<?,Character,?,Character>,Character,net.automatalib.words.Word<Character>>> |
class |
AbstractGrowingAlphabetTest<L extends SupportsGrowingAlphabet<I> & LearningAlgorithm<M,I,D>,M extends net.automatalib.automata.UniversalDeterministicAutomaton<?,I,?,?,?> & net.automatalib.automata.concepts.Output<I,D>,OR,I,D>
Simple (abstract super) test class that checks the basic workflow of a learning algorithm that implements
SupportsGrowingAlphabet . |
class |
AbstractResumableLearnerDFATest<L extends ResumableLearner<T> & LearningAlgorithm<net.automatalib.automata.fsa.DFA<?,Character>,Character,Boolean>,T extends Serializable> |
class |
AbstractResumableLearnerMealyTest<L extends ResumableLearner<T> & LearningAlgorithm<net.automatalib.automata.transout.MealyMachine<?,Character,?,Character>,Character,net.automatalib.words.Word<Character>>,T extends Serializable> |
class |
AbstractResumableLearnerTest<L extends ResumableLearner<T> & LearningAlgorithm<M,I,D>,M extends net.automatalib.automata.UniversalDeterministicAutomaton<?,I,?,?,?> & net.automatalib.automata.concepts.Output<I,D>,OR,I,D,T extends Serializable>
Test class that checks the workflow of a learning algorithm that implements
ResumableLearner . |
Modifier and Type | Method and Description |
---|---|
void |
LearnerVariantList.addLearnerVariant(String name,
LearningAlgorithm<? extends M,I,D> learner)
Adds a learner variant with the default maximum number of rounds (i.e., the size of the target automaton) to the
list.
|
void |
LearnerVariantList.addLearnerVariant(String name,
LearningAlgorithm<? extends M,I,D> learner,
int maxRounds)
Adds a learner variant with a given maximum number of rounds to the list.
|
Constructor and Description |
---|
DFAExperiment(LearningAlgorithm<? extends net.automatalib.automata.fsa.DFA<?,I>,I,Boolean> learningAlgorithm,
EquivalenceOracle<? super net.automatalib.automata.fsa.DFA<?,I>,I,Boolean> equivalenceAlgorithm,
net.automatalib.words.Alphabet<I> inputs) |
Experiment(LearningAlgorithm<? extends A,I,D> learningAlgorithm,
EquivalenceOracle<? super A,I,D> equivalenceAlgorithm,
net.automatalib.words.Alphabet<I> inputs) |
MealyExperiment(LearningAlgorithm<? extends net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>> learningAlgorithm,
EquivalenceOracle<? super net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>> equivalenceAlgorithm,
net.automatalib.words.Alphabet<I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <M extends net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,O> |
MealyUtil.wrapSymbolLearner(LearningAlgorithm<M,I,O> learner) |
Modifier and Type | Class and Description |
---|---|
class |
NFALearnerWrapper<I> |
Constructor and Description |
---|
NFALearnerWrapper(net.automatalib.words.Alphabet<I> alphabet,
LearningAlgorithm<? extends net.automatalib.automata.fsa.NFA<?,I>,I,Boolean> nfaLearner) |
Copyright © 2018. All rights reserved.