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>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() |
protected Query<I,Boolean> |
spQuery(HState<I,Boolean,Boolean,Void> state) |
protected Query<I,Boolean> |
tpQuery(HTransition<I,Boolean,Boolean,Void> transition) |
createState, getDiscriminationTree, getHypothesisDS, initializeState, refineHypothesis, refineHypothesisSingle, startLearning, updateHypothesis, updateTransitionclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitrefineHypothesis, startLearningpublic 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.Copyright © 2014. All Rights Reserved.