A B C D E F G H I M N R S T U

A

AbstractDTLearner<M extends net.automatalib.automata.concepts.SuffixOutput<I,D>,I,D,SP,TP> - Class in de.learnlib.algorithms.discriminationtree

AbstractDTLearner(Alphabet<I>, MembershipOracle<I, D>, LocalSuffixFinder<? super I, ? super D>, boolean, AbstractWordBasedDiscriminationTree<I, D, HState<I, D, SP, TP>>) - Constructor for class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

AbstractDTLearner.BuilderDefaults - Class in de.learnlib.algorithms.discriminationtree

addAlphabetSymbol(I) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

addAlphabetSymbol(I) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

addNonTreeIncoming(HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

alphabet - Variable in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

appendAccessSequence(List<? super I>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

B

BuilderDefaults() - Constructor for class de.learnlib.algorithms.discriminationtree.AbstractDTLearner.BuilderDefaults

BuilderDefaults() - Constructor for class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA.BuilderDefaults

C

createState(HTransition<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

createState(HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

currentTarget() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

D

de.learnlib.algorithms.discriminationtree - package de.learnlib.algorithms.discriminationtree

de.learnlib.algorithms.discriminationtree.dfa - package de.learnlib.algorithms.discriminationtree.dfa

de.learnlib.algorithms.discriminationtree.hypothesis - package de.learnlib.algorithms.discriminationtree.hypothesis

de.learnlib.algorithms.discriminationtree.mealy - package de.learnlib.algorithms.discriminationtree.mealy

DTLearnerDFA<I> - Class in de.learnlib.algorithms.discriminationtree.dfa

Algorithm for learning DFA using the Discrimination Tree algorithm.

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

Constructor.

DTLearnerDFA.BuilderDefaults - Class in de.learnlib.algorithms.discriminationtree.dfa

DTLearnerHypothesis<I,O,SP,TP> - Class in de.learnlib.algorithms.discriminationtree.hypothesis

Basic hypothesis data structure for Discrimination Tree learning algorithms.

DTLearnerHypothesis(Alphabet<I>) - Constructor for class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

DTLearnerHypothesis.GraphView - Class in de.learnlib.algorithms.discriminationtree.hypothesis

DTLearnerMealy<I,O> - Class in de.learnlib.algorithms.discriminationtree.mealy

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

Constructor.

DTLearnerState<I,D,SP,TP> - Class in de.learnlib.algorithms.discriminationtree

Class that contains all data that represent the internal state of the DTLearnerState learner and its DFA and Mealy implementations.

dtree - Variable in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

E

ensureInputCapacity(int) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

See ResizingObjectArray.ensureCapacity(int).

epsilonRoot() - Static method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA.BuilderDefaults

F

fetchNonTreeIncoming(Collection<? super HTransition<I, O, SP, TP>>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

G

getAccessSequence() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getAccessSequence() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getDepth() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getDiscriminationTree() - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

getDT() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getDTLeaf() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getHypothesisDS() - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

getHypothesisModel() - Method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA

getHypothesisModel() - Method in class de.learnlib.algorithms.discriminationtree.mealy.DTLearnerMealy

getId() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getInitialState() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getNode(int) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

getNodeId(HState<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

getNodes() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

getOutgoingEdges(HState<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

getOutgoingTransitions() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getProperty() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getProperty() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getSource() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getState(int) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getStateId(HState<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getStateProperty(HState<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getStates() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getSuccessor(HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getSymbol() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getTarget(HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

getTransition(HState<I, O, SP, TP>, I) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getTransition(int) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getTransitionProperty(HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

getTreeIncoming() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

getTreeTarget() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

getVisualizationHelper() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

graphView() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

GraphView() - Constructor for class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

H

HState<I,O,SP,TP> - Class in de.learnlib.algorithms.discriminationtree.hypothesis

HState(int) - Constructor for class de.learnlib.algorithms.discriminationtree.hypothesis.HState

HState(int, int, HTransition<I, O, SP, TP>) - Constructor for class de.learnlib.algorithms.discriminationtree.hypothesis.HState

HTransition<I,O,SP,TP> - Class in de.learnlib.algorithms.discriminationtree.hypothesis

HTransition(HState<I, O, SP, TP>, I, AbstractWordBasedDTNode<I, O, HState<I, O, SP, TP>>) - Constructor for class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

hypothesis - Variable in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

I

initializeState(HState<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

isAccessSequence(Word<I>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

isTree() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

M

makeTree(HState<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

N

nodeIDs() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis.GraphView

nonTreeTarget() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

R

refineHypothesis(DefaultQuery<I, D>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

refineHypothesisSingle(DefaultQuery<I, D>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

repeatedCounterexampleEvaluation() - Static method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner.BuilderDefaults

repeatedCounterexampleEvaluation() - Static method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA.BuilderDefaults

resume(DTLearnerState<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

resume(DTLearnerState<I, Boolean, Boolean, Void>) - Method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA

resume(DTLearnerState<I, Word<O>, Void, O>) - Method in class de.learnlib.algorithms.discriminationtree.mealy.DTLearnerMealy

S

setDT(AbstractWordBasedDTNode<I, O, HState<I, O, SP, TP>>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

setDTLeaf(AbstractWordBasedDTNode<I, O, HState<I, O, SP, TP>>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

setProperty(SP) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

setProperty(TP) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HTransition

setTransition(int, HTransition<I, O, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

spQuery(HState<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

spQuery(HState<I, Boolean, Boolean, Void>) - Method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA

spQuery(HState<I, Word<O>, Void, O>) - Method in class de.learnlib.algorithms.discriminationtree.mealy.DTLearnerMealy

startLearning() - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

stateIDs() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

suffixFinder() - Static method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner.BuilderDefaults

suffixFinder() - Static method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA.BuilderDefaults

suspend() - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

T

toString() - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.HState

tpQuery(HTransition<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

tpQuery(HTransition<I, Boolean, Boolean, Void>) - Method in class de.learnlib.algorithms.discriminationtree.dfa.DTLearnerDFA

tpQuery(HTransition<I, Word<O>, Void, O>) - Method in class de.learnlib.algorithms.discriminationtree.mealy.DTLearnerMealy

transformAccessSequence(Word<I>) - Method in class de.learnlib.algorithms.discriminationtree.hypothesis.DTLearnerHypothesis

U

updateHypothesis() - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

updateTransition(HTransition<I, D, SP, TP>) - Method in class de.learnlib.algorithms.discriminationtree.AbstractDTLearner

A B C D E F G H I M N R S T U