public class MealyDHC<I,O> extends Object implements LearningAlgorithm.MealyLearner<I,O>, AccessSequenceTransformer<I>, GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O>
| Modifier and Type | Class and Description |
|---|---|
static class |
MealyDHC.BuilderDefaults |
GlobalSuffixLearner.GlobalSuffixLearnerDFA<I>, GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O>LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>| Constructor and Description |
|---|
MealyDHC(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,net.automatalib.words.Word<O>> oracle)
Constructor, provided for backwards compatibility reasons.
|
MealyDHC(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,net.automatalib.words.Word<O>> oracle,
GlobalSuffixFinder<? super I,? super net.automatalib.words.Word<O>> suffixFinder,
Collection<? extends net.automatalib.words.Word<I>> initialSplitters)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
boolean |
addGlobalSuffixes(Collection<? extends net.automatalib.words.Word<I>> newGlobalSuffixes) |
protected boolean |
addSuffixesUnchecked(Collection<? extends net.automatalib.words.Word<I>> newSuffixes) |
Collection<? extends net.automatalib.words.Word<I>> |
getGlobalSuffixes() |
net.automatalib.automata.transout.MealyMachine<?,I,?,O> |
getHypothesisModel() |
boolean |
isAccessSequence(net.automatalib.words.Word<I> word) |
boolean |
refineHypothesis(DefaultQuery<I,net.automatalib.words.Word<O>> ceQuery) |
void |
startLearning() |
net.automatalib.words.Word<I> |
transformAccessSequence(net.automatalib.words.Word<I> word) |
public MealyDHC(net.automatalib.words.Alphabet<I> alphabet, MembershipOracle<I,net.automatalib.words.Word<O>> oracle)
alphabet - the learning alphabetoracle - the learning membership oraclepublic MealyDHC(net.automatalib.words.Alphabet<I> alphabet, MembershipOracle<I,net.automatalib.words.Word<O>> oracle, GlobalSuffixFinder<? super I,? super net.automatalib.words.Word<O>> suffixFinder, Collection<? extends net.automatalib.words.Word<I>> initialSplitters)
alphabet - the learning alphabetoracle - the learning membership oraclesuffixFinder - the suffix finder to use for analyzing counterexamplesinitialSplitters - the initial set of splitters, null or an empty collection will result
in the set of splitters being initialized as the set of alphabet symbols (interpreted as Words)public void startLearning()
startLearning in interface LearningAlgorithm<net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>>public boolean refineHypothesis(DefaultQuery<I,net.automatalib.words.Word<O>> ceQuery)
refineHypothesis in interface LearningAlgorithm<net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>>public net.automatalib.automata.transout.MealyMachine<?,I,?,O> getHypothesisModel()
getHypothesisModel in interface LearningAlgorithm<net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>>public net.automatalib.words.Word<I> transformAccessSequence(net.automatalib.words.Word<I> word)
transformAccessSequence in interface AccessSequenceTransformer<I>public boolean isAccessSequence(net.automatalib.words.Word<I> word)
isAccessSequence in interface AccessSequenceTransformer<I>public Collection<? extends net.automatalib.words.Word<I>> getGlobalSuffixes()
getGlobalSuffixes in interface GlobalSuffixFeature<I>public boolean addGlobalSuffixes(Collection<? extends net.automatalib.words.Word<I>> newGlobalSuffixes)
addGlobalSuffixes in interface GlobalSuffixFeature<I>protected boolean addSuffixesUnchecked(Collection<? extends net.automatalib.words.Word<I>> newSuffixes)
Copyright © 2014. All Rights Reserved.