Modifier and Type | Method and Description |
---|---|
static <I,O> LocalSuffixFinder<? super I,? super O> |
AbstractDTLearner.BuilderDefaults.suffixFinder() |
Constructor and Description |
---|
AbstractDTLearner(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,D> oracle,
LocalSuffixFinder<? super I,? super D> suffixFinder,
boolean repeatedCounterexampleEvaluation,
AbstractWordBasedDiscriminationTree<I,D,HState<I,D,SP,TP>> dtree) |
Modifier and Type | Method and Description |
---|---|
static <I,O> LocalSuffixFinder<? super I,? super O> |
DTLearnerDFA.BuilderDefaults.suffixFinder() |
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.
|
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 |
---|---|
static <I,D> ObservationTableCEXHandler<I,D> |
ObservationTableCEXHandlers.fromLocalSuffixFinder(LocalSuffixFinder<I,D> localFinder) |
static <I,D> ObservationTableCEXHandler<I,D> |
ObservationTableCEXHandlers.fromLocalSuffixFinder(LocalSuffixFinder<I,D> localFinder,
boolean allSuffixes) |
Modifier and Type | Class and Description |
---|---|
class |
AcexLocalSuffixFinder
Wraps a
AbstractNamedAcexAnalyzer . |
Modifier and Type | Field and Description |
---|---|
static LocalSuffixFinder<Object,Object> |
LocalSuffixFinders.FIND_LINEAR
Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in
linear ascending order.
|
static LocalSuffixFinder<Object,Object> |
LocalSuffixFinders.FIND_LINEAR_REVERSE
Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations in
linear descending order.
|
static LocalSuffixFinder<Object,Object> |
LocalSuffixFinders.RIVEST_SCHAPIRE
Searches for a distinguishing suffixes by checking for counterexample yielding access sequence transformations
using a binary search, as proposed by Rivest & Schapire.
|
Modifier and Type | Method and Description |
---|---|
static LocalSuffixFinder<Object,Object>[] |
LocalSuffixFinders.values() |
Modifier and Type | Method and Description |
---|---|
static <I,D> GlobalSuffixFinder<I,D> |
GlobalSuffixFinders.fromLocalFinder(LocalSuffixFinder<I,D> localFinder)
Transforms a
LocalSuffixFinder into a global one. |
static <I,D> GlobalSuffixFinder<I,D> |
GlobalSuffixFinders.fromLocalFinder(LocalSuffixFinder<I,D> localFinder,
boolean allSuffixes)
Transforms a
LocalSuffixFinder into a global one. |
Copyright © 2018. All rights reserved.