public class TTTLearnerDFA<I> extends BaseTTTLearner<DFA<?,I>,I,Boolean> implements LearningAlgorithm.DFALearner<I>
BaseTTTLearner.BuilderDefaults, BaseTTTLearner.Splitter<I,D>
LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>
alphabet, blockList, dtree, hypothesis
Constructor and Description |
---|
TTTLearnerDFA(Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
LocalSuffixFinder<? super I,? super Boolean> suffixFinder) |
Modifier and Type | Method and Description |
---|---|
protected Boolean |
computeHypothesisOutput(TTTState<I,Boolean> state,
Iterable<? extends I> suffix) |
GraphDOTHelper<TTTState<I,Boolean>,TTTHypothesis.TTTEdge<I,Boolean>> |
getHypothesisDOTHelper() |
TTTHypothesisDFA<I> |
getHypothesisDS() |
DFA<?,I> |
getHypothesisModel()
Returns the current hypothesis model.
|
protected void |
initializeState(TTTState<I,Boolean> state)
Initializes a state.
|
protected Boolean |
predictSuccOutcome(TTTTransition<I,Boolean> trans,
DTNode<I,Boolean> succSeparator) |
addEventListener, chooseInnerNode, chooseLeaf, computeOutput, computeSuffixOutput, createMap, createTransition, declareFinal, dtGraphView, finalizeAny, getDiscriminationTree, getState, getTarget, isAccessSequence, query, query, refineHypothesis, removeEventListener, split, startLearning, transformAccessSequence
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
refineHypothesis, startLearning
public TTTLearnerDFA(Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, LocalSuffixFinder<? super I,? super Boolean> suffixFinder)
public TTTHypothesisDFA<I> getHypothesisDS()
getHypothesisDS
in class BaseTTTLearner<DFA<?,I>,I,Boolean>
public 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<DFA<?,I>,I,Boolean>
protected void initializeState(TTTState<I,Boolean> state)
BaseTTTLearner
initializeState
in class BaseTTTLearner<DFA<?,I>,I,Boolean>
state
- the state to initializeprotected Boolean predictSuccOutcome(TTTTransition<I,Boolean> trans, DTNode<I,Boolean> succSeparator)
predictSuccOutcome
in class BaseTTTLearner<DFA<?,I>,I,Boolean>
protected Boolean computeHypothesisOutput(TTTState<I,Boolean> state, Iterable<? extends I> suffix)
computeHypothesisOutput
in class BaseTTTLearner<DFA<?,I>,I,Boolean>
public GraphDOTHelper<TTTState<I,Boolean>,TTTHypothesis.TTTEdge<I,Boolean>> getHypothesisDOTHelper()
getHypothesisDOTHelper
in class BaseTTTLearner<DFA<?,I>,I,Boolean>
Copyright © 2015. All rights reserved.