I
- input symbol classpublic class DTLearnerDFA<I> extends AbstractDTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean,Boolean,Void> implements LearningAlgorithm.DFALearner<I>
Modifier and Type | Class and Description |
---|---|
static class |
DTLearnerDFA.BuilderDefaults |
LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>
alphabet, dtree, hypothesis
Constructor and Description |
---|
DTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
LocalSuffixFinder<? super I,? super Boolean> suffixFinder,
boolean repeatedCounterexampleEvaluation,
boolean epsilonRoot)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
net.automatalib.automata.fsa.DFA<?,I> |
getHypothesisModel()
Returns the current hypothesis model.
|
void |
resume(DTLearnerState<I,Boolean,Boolean,Void> state)
Does not get the learner to continue learning.
|
protected Query<I,Boolean> |
spQuery(HState<I,Boolean,Boolean,Void> state) |
protected Query<I,Boolean> |
tpQuery(HTransition<I,Boolean,Boolean,Void> transition) |
addAlphabetSymbol, createState, getDiscriminationTree, getHypothesisDS, initializeState, refineHypothesis, refineHypothesisSingle, startLearning, suspend, updateHypothesis, updateTransition
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
refineHypothesis, startLearning
public DTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, LocalSuffixFinder<? super I,? super Boolean> suffixFinder, boolean repeatedCounterexampleEvaluation, boolean epsilonRoot)
alphabet
- the input alphabetoracle
- the membership oraclesuffixFinder
- method to use for analyzing counterexamplesepsilonRoot
- whether or not to ensure the root of the discrimination tree is always labeled using the empty word.public net.automatalib.automata.fsa.DFA<?,I> getHypothesisModel()
LearningAlgorithm
N.B.: By the contract of this interface, the model returned by this method may not be modified (i.e., M generally
should refer to an immutable interface), and its validity is retained only until the next invocation of LearningAlgorithm.refineHypothesis(DefaultQuery)
. If older hypotheses have to be maintained, a copy of the returned model must be
made.
Please note that it should be illegal to invoke this method before an initial invocation of LearningAlgorithm.startLearning()
.
getHypothesisModel
in interface LearningAlgorithm<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean>
public void resume(DTLearnerState<I,Boolean,Boolean,Void> state)
ResumableLearner
resume
in interface ResumableLearner<DTLearnerState<I,Boolean,Boolean,Void>>
resume
in class AbstractDTLearner<net.automatalib.automata.fsa.DFA<?,I>,I,Boolean,Boolean,Void>
state
- The learner state.Copyright © 2018. All rights reserved.