Modifier and Type | Field and Description |
---|---|
protected AbstractWordBasedDiscriminationTree<I,D,HState<I,D,SP,TP>> |
AbstractDTLearner.dtree |
Modifier and Type | Method and Description |
---|---|
protected HState<I,D,SP,TP> |
AbstractDTLearner.createState(HTransition<I,D,SP,TP> trans) |
Modifier and Type | Method and Description |
---|---|
AbstractWordBasedDiscriminationTree<I,D,HState<I,D,SP,TP>> |
AbstractDTLearner.getDiscriminationTree() |
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractDTLearner.initializeState(HState<I,D,SP,TP> newState) |
protected abstract Query<I,D> |
AbstractDTLearner.spQuery(HState<I,D,SP,TP> state) |
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 |
---|---|
protected Query<I,Boolean> |
DTLearnerDFA.spQuery(HState<I,Boolean,Boolean,Void> state) |
Modifier and Type | Method and Description |
---|---|
HState<I,O,SP,TP> |
DTLearnerHypothesis.createState(HTransition<I,O,SP,TP> treeIncoming) |
HState<I,O,SP,TP> |
HTransition.currentTarget() |
HState<I,O,SP,TP> |
DTLearnerHypothesis.getInitialState() |
HState<I,O,SP,TP> |
DTLearnerHypothesis.GraphView.getNode(int id) |
HState<I,O,SP,TP> |
HTransition.getSource() |
HState<I,O,SP,TP> |
DTLearnerHypothesis.getState(int id) |
HState<I,O,SP,TP> |
DTLearnerHypothesis.getSuccessor(HTransition<I,O,SP,TP> trans) |
HState<I,O,SP,TP> |
DTLearnerHypothesis.GraphView.getTarget(HTransition<I,O,SP,TP> edge) |
HState<I,O,SP,TP> |
HTransition.getTreeTarget() |
HState<I,O,SP,TP> |
HTransition.nonTreeTarget() |
Modifier and Type | Method and Description |
---|---|
AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> |
HTransition.getDT() |
AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> |
HState.getDTLeaf() |
Collection<HState<I,O,SP,TP>> |
DTLearnerHypothesis.GraphView.getNodes() |
Collection<HState<I,O,SP,TP>> |
DTLearnerHypothesis.getStates() |
net.automatalib.visualization.VisualizationHelper<HState<I,O,SP,TP>,HTransition<I,O,SP,TP>> |
DTLearnerHypothesis.GraphView.getVisualizationHelper() |
net.automatalib.graphs.concepts.NodeIDs<HState<I,O,SP,TP>> |
DTLearnerHypothesis.GraphView.nodeIDs() |
net.automatalib.automata.concepts.StateIDs<HState<I,O,SP,TP>> |
DTLearnerHypothesis.stateIDs() |
Modifier and Type | Method and Description |
---|---|
int |
DTLearnerHypothesis.GraphView.getNodeId(HState<I,O,SP,TP> node) |
Collection<HTransition<I,O,SP,TP>> |
DTLearnerHypothesis.GraphView.getOutgoingEdges(HState<I,O,SP,TP> node) |
int |
DTLearnerHypothesis.getStateId(HState<I,O,SP,TP> state) |
SP |
DTLearnerHypothesis.getStateProperty(HState<I,O,SP,TP> state) |
HTransition<I,O,SP,TP> |
DTLearnerHypothesis.getTransition(HState<I,O,SP,TP> state,
I symbol) |
void |
HTransition.makeTree(HState<I,O,SP,TP> treeTgt) |
Modifier and Type | Method and Description |
---|---|
void |
HTransition.setDT(AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtNode) |
void |
HState.setDTLeaf(AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtLeaf) |
Constructor and Description |
---|
HTransition(HState<I,O,SP,TP> source,
I symbol,
AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtTgt) |
Constructor and Description |
---|
HTransition(HState<I,O,SP,TP> source,
I symbol,
AbstractWordBasedDTNode<I,O,HState<I,O,SP,TP>> dtTgt) |
Modifier and Type | Method and Description |
---|---|
protected Query<I,net.automatalib.words.Word<O>> |
DTLearnerMealy.spQuery(HState<I,net.automatalib.words.Word<O>,Void,O> state) |
Copyright © 2018. All rights reserved.