public class TTTLearnerMealy<I,O> extends BaseTTTLearner<MealyMachine<?,I,?,O>,I,Word<O>>
BaseTTTLearner.BuilderDefaults, BaseTTTLearner.Splitter<I,D>LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>alphabet, blockList, dtree, hypothesis| Constructor and Description |
|---|
TTTLearnerMealy(Alphabet<I> alphabet,
MembershipOracle<I,Word<O>> oracle,
LocalSuffixFinder<? super I,? super Word<O>> suffixFinder) |
| Modifier and Type | Method and Description |
|---|---|
protected Word<O> |
computeHypothesisOutput(TTTState<I,Word<O>> state,
Iterable<? extends I> suffix) |
protected TTTTransition<I,Word<O>> |
createTransition(TTTState<I,Word<O>> state,
I sym) |
MealyMachine<?,I,?,O> |
getHypothesisModel() |
protected Word<O> |
predictSuccOutcome(TTTTransition<I,Word<O>> trans,
DTNode<I,Word<O>> succSeparator) |
addEventListener, chooseInnerNode, chooseLeaf, computeOutput, computeSuffixOutput, createMap, declareFinal, dtGraphView, finalizeAny, getDiscriminationTree, getHypothesisDOTHelper, getHypothesisDS, getState, getTarget, initializeState, isAccessSequence, query, query, refineHypothesis, removeEventListener, split, startLearning, transformAccessSequencepublic TTTLearnerMealy(Alphabet<I> alphabet, MembershipOracle<I,Word<O>> oracle, LocalSuffixFinder<? super I,? super Word<O>> suffixFinder)
public MealyMachine<?,I,?,O> getHypothesisModel()
protected TTTTransition<I,Word<O>> createTransition(TTTState<I,Word<O>> state, I sym)
createTransition in class BaseTTTLearner<MealyMachine<?,I,?,O>,I,Word<O>>protected Word<O> predictSuccOutcome(TTTTransition<I,Word<O>> trans, DTNode<I,Word<O>> succSeparator)
predictSuccOutcome in class BaseTTTLearner<MealyMachine<?,I,?,O>,I,Word<O>>Copyright © 2015. All Rights Reserved.