A B C D E F G H I L M N P Q R S T

A

AccessSequenceProvider<I> - Interface in de.learnlib.algorithms.ttt.base

Common interface for objects that have an access sequence associated with them (e.g., states and transitions of a TTTHypothesis).

addEventListener(TTTEventListener<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

alphabet - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

alphabet - Variable in class de.learnlib.algorithms.ttt.base.TTTHypothesis

B

BaseTTTLearner<A,I,D> - Class in de.learnlib.algorithms.ttt.base

The TTT learning algorithm for DFA.

BaseTTTLearner(Alphabet<I>, MembershipOracle<I, D>, TTTHypothesis<I, D, ?>, LocalSuffixFinder<? super I, ? super D>) - Constructor for class de.learnlib.algorithms.ttt.base.BaseTTTLearner

BaseTTTLearner.BuilderDefaults - Class in de.learnlib.algorithms.ttt.base

BaseTTTLearner.Splitter<I,D> - Class in de.learnlib.algorithms.ttt.base

Data structure for representing a splitter.

blockList - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

The blocks during a split operation.

BlockList<I,D> - Class in de.learnlib.algorithms.ttt.base

A list for storing blocks (identified by their root DTNodes).

BlockList() - Constructor for class de.learnlib.algorithms.ttt.base.BlockList

BlockListElem<I,D> - Class in de.learnlib.algorithms.ttt.base

Abstract base class for objects that may occur in a BlockList, either as a value element or the head of the list (which represents the list itself, but does not carry any value).

BlockListElem() - Constructor for class de.learnlib.algorithms.ttt.base.BlockListElem

BuilderDefaults() - Constructor for class de.learnlib.algorithms.ttt.base.BaseTTTLearner.BuilderDefaults

C

child(D) - Method in class de.learnlib.algorithms.ttt.base.DTNode

choose() - Method in class de.learnlib.algorithms.ttt.base.IncomingList

chooseBlock() - Method in class de.learnlib.algorithms.ttt.base.BlockList

Retrieves any block from the list.

chooseInnerNode(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

chooseLeaf(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

computeHypothesisOutput(TTTState<I, D>, Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

computeHypothesisOutput(TTTState<I, Boolean>, Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

computeHypothesisOutput(TTTState<I, Word<O>>, Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.mealy.TTTLearnerMealy

computeOutput(Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

computeSuffixOutput(Iterable<? extends I>, Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

createMap() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

createState(TTTTransition<I, D>) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

createTransition(TTTState<I, D>, I) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

createTransition(TTTState<I, Word<O>>, I) - Method in class de.learnlib.algorithms.ttt.mealy.TTTLearnerMealy

D

de.learnlib.algorithms.ttt.base - package de.learnlib.algorithms.ttt.base

de.learnlib.algorithms.ttt.dfa - package de.learnlib.algorithms.ttt.dfa

de.learnlib.algorithms.ttt.mealy - package de.learnlib.algorithms.ttt.mealy

declareFinal(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

DiscriminationTree<I,D> - Class in de.learnlib.algorithms.ttt.base

The discrimination tree data structure.

DiscriminationTree(MembershipOracle<I, D>) - Constructor for class de.learnlib.algorithms.ttt.base.DiscriminationTree

DiscriminationTree.GraphView - Class in de.learnlib.algorithms.ttt.base

discriminator - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

dtGraphView() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

DTNode<I,D> - Class in de.learnlib.algorithms.ttt.base

DTNode() - Constructor for class de.learnlib.algorithms.ttt.base.DTNode

DTNode(DTNode<I, D>, D) - Constructor for class de.learnlib.algorithms.ttt.base.DTNode

dtree - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

E

ensureConsistency(TTTState<I, D>, DTNode<I, D>, D) - Method in interface de.learnlib.algorithms.ttt.base.TTTEventListener

F

finalizeAny() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Chooses a block root, and finalizes the corresponding discriminator.

G

getAccessSequence() - Method in interface de.learnlib.algorithms.ttt.base.AccessSequenceProvider

Retrieves the access sequence of this object.

getAccessSequence() - Method in class de.learnlib.algorithms.ttt.base.TTTState

getAccessSequence() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getChild(D) - Method in class de.learnlib.algorithms.ttt.base.DTNode

getChildEntries() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getChildren() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getDepth() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getDiscriminationTree() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Returns the discrimination tree.

getDiscriminator() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getDTLeaf() - Method in class de.learnlib.algorithms.ttt.base.TTTState

Retrieves the discrimination tree leaf associated with this state.

getDTTarget() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getExtremalChild(D) - Method in class de.learnlib.algorithms.ttt.base.DTNode

getGraphDOTHelper() - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree.GraphView

getGraphDOTHelper() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis.GraphView

getHypothesisDOTHelper() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

getHypothesisDOTHelper() - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

getHypothesisDS() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

getHypothesisDS() - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

getHypothesisModel() - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

getHypothesisModel() - Method in class de.learnlib.algorithms.ttt.mealy.TTTLearnerMealy

getIncoming() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getIncoming(D) - Method in class de.learnlib.algorithms.ttt.base.SplitData

Retrieves the list of incoming transitions for the respective label.

getInitialState() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

getInput() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getInputAlphabet() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

getInternalTransition(TTTState<I, D>, I) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

Retrieves the internal transition (i.e., the TTTTransition object) for a given state and input.

getLabels() - Method in class de.learnlib.algorithms.ttt.base.SplitData

getNodes() - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree.GraphView

getNodes() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis.GraphView

getNonTreeTarget() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getOutgoingEdges(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree.GraphView

getOutgoingEdges(TTTState<I, D>) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis.GraphView

getOutput() - Method in class de.learnlib.algorithms.ttt.mealy.TTTTransitionMealy

getParent() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getParentEdgeLabel() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getProperty() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getProperty() - Method in class de.learnlib.algorithms.ttt.mealy.TTTTransitionMealy

getRoot() - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

Retrieves the root node of this tree.

getSource() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getState(TTTState<I, D>, Iterable<? extends I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Retrieves the successor for a given state and a suffix sequence.

getState() - Method in class de.learnlib.algorithms.ttt.base.DTNode

getStateLabel() - Method in class de.learnlib.algorithms.ttt.base.SplitData

Retrieves the state label associated with this split data.

getStates() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

getSuccessor(TTTState<I, Boolean>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTHypothesisDFA

getSuccessor(TTTTransitionMealy<I, O>) - Method in class de.learnlib.algorithms.ttt.mealy.TTTHypothesisMealy

getTarget(TTTTransition<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Retrieves the target state of a given transition.

getTarget(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree.GraphView

getTarget(TTTHypothesis.TTTEdge<I, D>) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis.GraphView

getTarget() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

getTransition(TTTState<I, D>, I) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

getTransitionOutput(TTTTransitionMealy<I, O>) - Method in class de.learnlib.algorithms.ttt.mealy.TTTHypothesisMealy

getTreeTarget() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

graphView() - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

GraphView() - Constructor for class de.learnlib.algorithms.ttt.base.DiscriminationTree.GraphView

graphView() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

GraphView() - Constructor for class de.learnlib.algorithms.ttt.base.TTTHypothesis.GraphView

H

hasStateLabel() - Method in class de.learnlib.algorithms.ttt.base.SplitData

Checks whether there is a state label associated with this node, regardless of its value.

hypothesis - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

I

IncomingList<I,D> - Class in de.learnlib.algorithms.ttt.base

The head of the intrusive linked list for storing incoming transitions of a DT node.

IncomingList() - Constructor for class de.learnlib.algorithms.ttt.base.IncomingList

IncomingListElem<I,D> - Class in de.learnlib.algorithms.ttt.base

An element in an IncomingList.

IncomingListElem() - Constructor for class de.learnlib.algorithms.ttt.base.IncomingListElem

initialize() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

Initializes the automaton, adding an initial state.

initializeState(TTTState<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Initializes a state.

initializeState(TTTState<I, Boolean>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

innerNodes() - Method in class de.learnlib.algorithms.ttt.base.DTNode

innerNodesIterator() - Method in class de.learnlib.algorithms.ttt.base.DTNode

insertAllIncoming(IncomingList<I, D>) - Method in class de.learnlib.algorithms.ttt.base.IncomingList

insertAllIncoming(TTTTransition<I, D>) - Method in class de.learnlib.algorithms.ttt.base.IncomingList

insertBlock(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BlockList

Inserts a block into the list.

insertIncoming(TTTTransition<I, D>) - Method in class de.learnlib.algorithms.ttt.base.IncomingList

isAccepting(TTTState<I, Boolean>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTHypothesisDFA

isAccepting() - Method in class de.learnlib.algorithms.ttt.dfa.TTTStateDFA

isAccessSequence(Word<I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

isEmpty() - Method in class de.learnlib.algorithms.ttt.base.BlockList

Checks whether this list is empty.

isInitialized() - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

Checks whether this automaton was initialized (i.e., TTTHypothesis.initialize() has been called).

isInner() - Method in class de.learnlib.algorithms.ttt.base.DTNode

isLeaf() - Method in class de.learnlib.algorithms.ttt.base.DTNode

isMarked(D) - Method in class de.learnlib.algorithms.ttt.base.SplitData

Checks whether the corresponding node is marked with the given label.

isRoot() - Method in class de.learnlib.algorithms.ttt.base.TTTState

Checks whether this state is the initial state (i.e., the root of the spanning tree).

isTemp() - Method in class de.learnlib.algorithms.ttt.base.DTNode

isTree() - Method in class de.learnlib.algorithms.ttt.base.TTTTransition

iterator() - Method in class de.learnlib.algorithms.ttt.base.BlockList

iterator() - Method in class de.learnlib.algorithms.ttt.base.IncomingList

L

leastCommonAncestor(DTNode<I, D>, DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

M

mapTransition(TTTTransition<I, D>) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

mapTransition(TTTTransition<I, Boolean>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTHypothesisDFA

mapTransition(TTTTransition<I, Word<O>>) - Method in class de.learnlib.algorithms.ttt.mealy.TTTHypothesisMealy

mark(D) - Method in class de.learnlib.algorithms.ttt.base.SplitData

Mark this node with the given label.

N

newState(int, TTTTransition<I, D>, int) - Method in class de.learnlib.algorithms.ttt.base.TTTHypothesis

newState(int, TTTTransition<I, Boolean>, int) - Method in class de.learnlib.algorithms.ttt.dfa.TTTHypothesisDFA

nextBlock - Variable in class de.learnlib.algorithms.ttt.base.BlockListElem

nextIncoming - Variable in class de.learnlib.algorithms.ttt.base.IncomingListElem

P

postFinalizeDiscriminator(DTNode<I, D>, BaseTTTLearner.Splitter<I, D>) - Method in interface de.learnlib.algorithms.ttt.base.TTTEventListener

postSplit(TTTTransition<I, D>, Word<I>) - Method in interface de.learnlib.algorithms.ttt.base.TTTEventListener

predictSuccOutcome(TTTTransition<I, D>, DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

predictSuccOutcome(TTTTransition<I, Boolean>, DTNode<I, Boolean>) - Method in class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

predictSuccOutcome(TTTTransition<I, Word<O>>, DTNode<I, Word<O>>) - Method in class de.learnlib.algorithms.ttt.mealy.TTTLearnerMealy

preFinalizeDiscriminator(DTNode<I, D>, BaseTTTLearner.Splitter<I, D>) - Method in interface de.learnlib.algorithms.ttt.base.TTTEventListener

preSplit(TTTTransition<I, D>, Word<I>) - Method in interface de.learnlib.algorithms.ttt.base.TTTEventListener

prevIncoming - Variable in class de.learnlib.algorithms.ttt.base.TTTTransition

Q

query(Word<I>, Word<I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Performs a membership query.

query(AccessSequenceProvider<I>, Word<I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

Performs a membership query, using an access sequence as its prefix.

R

refineHypothesis(DefaultQuery<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

removeEventListener(TTTEventListener<I, D>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

S

setChild(D, DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.DTNode

setStateLabel(D) - Method in class de.learnlib.algorithms.ttt.base.SplitData

Sets the state label associated with this split data.

sift(AccessSequenceProvider<I>) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

Sifts an access sequence provided by an object into the tree, starting at the root.

sift(AccessSequenceProvider<I>, boolean) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

Sifts an access sequence provided by an object into the tree, starting at the root.

sift(Word<I>) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

sift(Word<I>, boolean) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

sift(DTNode<I, D>, AccessSequenceProvider<I>, boolean) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

sift(DTNode<I, D>, Word<I>, boolean) - Method in class de.learnlib.algorithms.ttt.base.DiscriminationTree

split(DTNode<I, D>, Word<I>, D...) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

SplitData<I,D> - Class in de.learnlib.algorithms.ttt.base

Data associated with a DTNode while an enclosing subtree is being split.

SplitData() - Constructor for class de.learnlib.algorithms.ttt.base.SplitData

Splitter(TTTState<I, D>, TTTState<I, D>, int) - Constructor for class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

Splitter(TTTState<I, D>, TTTState<I, D>, int, DTNode<I, D>) - Constructor for class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

startLearning() - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

state1 - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

state2 - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

subtreeLabel(DTNode<I, D>) - Method in class de.learnlib.algorithms.ttt.base.DTNode

subtreeLeaves() - Method in class de.learnlib.algorithms.ttt.base.DTNode

subtreeLeavesIterator() - Method in class de.learnlib.algorithms.ttt.base.DTNode

subtreeNodesIterator() - Method in class de.learnlib.algorithms.ttt.base.DTNode

subtreeStates() - Method in class de.learnlib.algorithms.ttt.base.DTNode

subtreeStatesIterator() - Method in class de.learnlib.algorithms.ttt.base.DTNode

succSeparator - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

suffixFinder() - Static method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.BuilderDefaults

symbolIdx - Variable in class de.learnlib.algorithms.ttt.base.BaseTTTLearner.Splitter

T

target - Variable in class de.learnlib.algorithms.ttt.base.TTTHypothesis.TTTEdge

toString() - Method in class de.learnlib.algorithms.ttt.base.TTTState

transformAccessSequence(Word<I>) - Method in class de.learnlib.algorithms.ttt.base.BaseTTTLearner

transition - Variable in class de.learnlib.algorithms.ttt.base.TTTHypothesis.TTTEdge

TTTEdge(TTTTransition<I, D>, TTTState<I, D>) - Constructor for class de.learnlib.algorithms.ttt.base.TTTHypothesis.TTTEdge

TTTEventListener<I,D> - Interface in de.learnlib.algorithms.ttt.base

TTTHypothesis<I,D,T> - Class in de.learnlib.algorithms.ttt.base

Hypothesis DFA for the TTT algorithm.

TTTHypothesis(Alphabet<I>) - Constructor for class de.learnlib.algorithms.ttt.base.TTTHypothesis

Constructor.

TTTHypothesis.GraphView - Class in de.learnlib.algorithms.ttt.base

TTTHypothesis.TTTEdge<I,D> - Class in de.learnlib.algorithms.ttt.base

TTTHypothesisDFA<I> - Class in de.learnlib.algorithms.ttt.dfa

TTTHypothesisDFA(Alphabet<I>) - Constructor for class de.learnlib.algorithms.ttt.dfa.TTTHypothesisDFA

TTTHypothesisMealy<I,O> - Class in de.learnlib.algorithms.ttt.mealy

TTTHypothesisMealy(Alphabet<I>) - Constructor for class de.learnlib.algorithms.ttt.mealy.TTTHypothesisMealy

TTTLearnerDFA<I> - Class in de.learnlib.algorithms.ttt.dfa

TTTLearnerDFA(Alphabet<I>, MembershipOracle<I, Boolean>, LocalSuffixFinder<? super I, ? super Boolean>) - Constructor for class de.learnlib.algorithms.ttt.dfa.TTTLearnerDFA

TTTLearnerMealy<I,O> - Class in de.learnlib.algorithms.ttt.mealy

TTTLearnerMealy(Alphabet<I>, MembershipOracle<I, Word<O>>, LocalSuffixFinder<? super I, ? super Word<O>>) - Constructor for class de.learnlib.algorithms.ttt.mealy.TTTLearnerMealy

TTTState<I,D> - Class in de.learnlib.algorithms.ttt.base

A state in a TTTHypothesis.

TTTState(int, TTTTransition<I, D>, int) - Constructor for class de.learnlib.algorithms.ttt.base.TTTState

TTTStateDFA<I> - Class in de.learnlib.algorithms.ttt.dfa

TTTStateDFA(int, TTTTransition<I, Boolean>, int) - Constructor for class de.learnlib.algorithms.ttt.dfa.TTTStateDFA

TTTTransition<I,D> - Class in de.learnlib.algorithms.ttt.base

A transition in a TTTHypothesis.

TTTTransition(TTTState<I, D>, I) - Constructor for class de.learnlib.algorithms.ttt.base.TTTTransition

TTTTransitionMealy<I,O> - Class in de.learnlib.algorithms.ttt.mealy

TTTTransitionMealy(TTTState<I, Word<O>>, I) - Constructor for class de.learnlib.algorithms.ttt.mealy.TTTTransitionMealy

A B C D E F G H I L M N P Q R S T