Package | Description |
---|---|
de.learnlib.algorithms.ttt.base | |
de.learnlib.algorithms.ttt.dfa | |
de.learnlib.algorithms.ttt.mealy |
Modifier and Type | Field and Description |
---|---|
AbstractBaseDTNode<I,D> |
AbstractTTTLearner.Splitter.succSeparator |
Modifier and Type | Method and Description |
---|---|
AbstractBaseDTNode<I,D> |
AbstractBaseDTNode.anyChild() |
protected abstract AbstractBaseDTNode<I,D> |
AbstractTTTLearner.createNewNode(AbstractBaseDTNode<I,D> parent,
D parentOutput) |
AbstractBaseDTNode<I,D> |
TTTState.getDTLeaf()
Retrieves the discrimination tree leaf associated with this state.
|
AbstractBaseDTNode<I,D> |
TTTTransition.getDTTarget() |
AbstractBaseDTNode<I,D> |
TTTTransition.getNonTreeTarget() |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
AccessSequenceProvider<I> asp,
boolean hard) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
net.automatalib.words.Word<I> prefix) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
net.automatalib.words.Word<I> word,
boolean hard) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AccessSequenceProvider<I> asp)
Sifts an access sequence provided by an object into the tree, starting at the root.
|
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AccessSequenceProvider<I> asp,
boolean hard)
Sifts an access sequence provided by an object into the tree, starting at the root.
|
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(net.automatalib.words.Word<I> word,
boolean hard) |
Modifier and Type | Method and Description |
---|---|
net.automatalib.visualization.VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>> |
BaseTTTDiscriminationTree.getVisualizationHelper() |
net.automatalib.visualization.VisualizationHelper<AbstractBaseDTNode<I,D>,Map.Entry<D,AbstractBaseDTNode<I,D>>> |
BaseTTTDiscriminationTree.getVisualizationHelper() |
Iterator<AbstractBaseDTNode<I,D>> |
AbstractBaseDTNode.subtreeNodesIterator() |
Modifier and Type | Method and Description |
---|---|
protected abstract AbstractBaseDTNode<I,D> |
AbstractTTTLearner.createNewNode(AbstractBaseDTNode<I,D> parent,
D parentOutput) |
protected void |
AbstractTTTLearner.declareFinal(AbstractBaseDTNode<I,D> blockRoot) |
void |
TTTEventListener.ensureConsistency(TTTState<I,D> state,
AbstractBaseDTNode<I,D> dtNode,
D realOutcome) |
void |
BlockList.insertBlock(AbstractBaseDTNode<I,D> blockRoot)
Inserts a block into the list.
|
protected static <I,D> void |
AbstractTTTLearner.link(AbstractBaseDTNode<I,D> dtNode,
TTTState<I,D> state)
Establish the connection between a node in the discrimination tree and a state of the hypothesis.
|
void |
TTTEventListener.postFinalizeDiscriminator(AbstractBaseDTNode<I,D> blockRoot,
AbstractTTTLearner.Splitter<I,D> splitter) |
protected abstract D |
AbstractTTTLearner.predictSuccOutcome(TTTTransition<I,D> trans,
AbstractBaseDTNode<I,D> succSeparator) |
void |
TTTEventListener.preFinalizeDiscriminator(AbstractBaseDTNode<I,D> blockRoot,
AbstractTTTLearner.Splitter<I,D> splitter) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
AccessSequenceProvider<I> asp,
boolean hard) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
net.automatalib.words.Word<I> prefix) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
net.automatalib.words.Word<I> word,
boolean hard) |
protected AbstractDTNode.SplitResult |
AbstractTTTLearner.split(AbstractBaseDTNode<I,D> node,
net.automatalib.words.Word<I> discriminator,
D oldOutput,
D newOutput) |
Constructor and Description |
---|
AbstractBaseDTNode(AbstractBaseDTNode<I,D> parent,
D parentEdgeLabel) |
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
AbstractBaseDTNode<I,D> root) |
Splitter(int symbolIdx,
AbstractBaseDTNode<I,D> succSeparator) |
Constructor and Description |
---|
BaseTTTDiscriminationTree(MembershipOracle<I,D> oracle,
Supplier<? extends AbstractBaseDTNode<I,D>> supplier) |
Modifier and Type | Class and Description |
---|---|
protected static class |
PrefixTTTLearnerDFA.ExtDTNode<I> |
class |
TTTDTNodeDFA<I>
Binary discrimination tree node specialization.
|
Modifier and Type | Method and Description |
---|---|
protected AbstractBaseDTNode<I,Boolean> |
TTTDTNodeDFA.createChild(Boolean outcome,
TTTState<I,Boolean> data) |
protected AbstractBaseDTNode<I,Boolean> |
TTTLearnerDFA.createNewNode(AbstractBaseDTNode<I,Boolean> parent,
Boolean parentOutput) |
Modifier and Type | Method and Description |
---|---|
protected Map<Boolean,AbstractBaseDTNode<I,Boolean>> |
TTTDTNodeDFA.createChildMap() |
Modifier and Type | Method and Description |
---|---|
protected AbstractBaseDTNode<I,Boolean> |
TTTLearnerDFA.createNewNode(AbstractBaseDTNode<I,Boolean> parent,
Boolean parentOutput) |
protected Boolean |
TTTLearnerDFA.predictSuccOutcome(TTTTransition<I,Boolean> trans,
AbstractBaseDTNode<I,Boolean> succSeparator) |
Constructor and Description |
---|
TTTDTNodeDFA(AbstractBaseDTNode<I,Boolean> parent,
Boolean parentEdgeLabel) |
Constructor and Description |
---|
TTTLearnerDFA(net.automatalib.words.Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
AcexAnalyzer analyzer,
Supplier<? extends AbstractBaseDTNode<I,Boolean>> rootSupplier) |
Modifier and Type | Class and Description |
---|---|
class |
TTTDTNodeMealy<I,D>
Generic n-ary discrimination tree node specialization.
|
Modifier and Type | Method and Description |
---|---|
protected AbstractBaseDTNode<I,D> |
TTTDTNodeMealy.createChild(D outcome,
TTTState<I,D> data) |
protected AbstractBaseDTNode<I,net.automatalib.words.Word<O>> |
TTTLearnerMealy.createNewNode(AbstractBaseDTNode<I,net.automatalib.words.Word<O>> parent,
net.automatalib.words.Word<O> parentOutput) |
Modifier and Type | Method and Description |
---|---|
protected Map<D,AbstractBaseDTNode<I,D>> |
TTTDTNodeMealy.createChildMap() |
Modifier and Type | Method and Description |
---|---|
protected AbstractBaseDTNode<I,net.automatalib.words.Word<O>> |
TTTLearnerMealy.createNewNode(AbstractBaseDTNode<I,net.automatalib.words.Word<O>> parent,
net.automatalib.words.Word<O> parentOutput) |
protected net.automatalib.words.Word<O> |
TTTLearnerMealy.predictSuccOutcome(TTTTransition<I,net.automatalib.words.Word<O>> trans,
AbstractBaseDTNode<I,net.automatalib.words.Word<O>> succSeparator) |
Constructor and Description |
---|
TTTDTNodeMealy(AbstractBaseDTNode<I,D> parent,
D parentEdgeLabel) |
Copyright © 2018. All rights reserved.