I - input symbol typeO - output symbol typepublic class DTLearnerMealy<I,O> extends AbstractDTLearner<net.automatalib.automata.transout.MealyMachine<?,I,?,O>,I,net.automatalib.words.Word<O>,Void,O> implements LearningAlgorithm.MealyLearner<I,O>
AbstractDTLearner.BuilderDefaultsLearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>dtree, hypothesis| Constructor and Description |
|---|
DTLearnerMealy(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,net.automatalib.words.Word<O>> oracle,
LocalSuffixFinder<? super I,? super net.automatalib.words.Word<O>> suffixFinder,
boolean repeatedCounterexampleEvaluation)
Constructor.
|
| Modifier and Type | Method and Description |
|---|---|
net.automatalib.automata.transout.MealyMachine<?,I,?,O> |
getHypothesisModel() |
protected Query<I,net.automatalib.words.Word<O>> |
spQuery(HState<I,net.automatalib.words.Word<O>,Void,O> state) |
protected Query<I,net.automatalib.words.Word<O>> |
tpQuery(HTransition<I,net.automatalib.words.Word<O>,Void,O> transition) |
createState, getDiscriminationTree, getHypothesisDS, initializeState, refineHypothesis, refineHypothesisSingle, startLearning, updateHypothesis, updateTransitionclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitrefineHypothesis, startLearningpublic DTLearnerMealy(net.automatalib.words.Alphabet<I> alphabet, MembershipOracle<I,net.automatalib.words.Word<O>> oracle, LocalSuffixFinder<? super I,? super net.automatalib.words.Word<O>> suffixFinder, boolean repeatedCounterexampleEvaluation)
alphabet - the input alphabetoracle - the membership oraclesuffixFinder - method to use for analyzing counterexamplespublic 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>>protected Query<I,net.automatalib.words.Word<O>> spQuery(HState<I,net.automatalib.words.Word<O>,Void,O> state)
Copyright © 2014. All Rights Reserved.