de.learnlib.algorithms.discriminationtree.hypothesis.vpda

Class DTree<I>

java.lang.Object

de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>

de.learnlib.algorithms.discriminationtree.hypothesis.vpda.DTree<I>

Type Parameters:

I - input symbol type

All Implemented Interfaces:

Serializable, Iterable<DTNode<I>>, net.automatalib.graphs.Graph<DTNode<I>,Map.Entry<Boolean,DTNode<I>>>, net.automatalib.graphs.IndefiniteGraph<DTNode<I>,Map.Entry<Boolean,DTNode<I>>>, net.automatalib.graphs.IndefiniteSimpleGraph<DTNode<I>>, net.automatalib.graphs.SimpleGraph<DTNode<I>>

public class DTree<I>
extends AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>

Author:

Malte Isberner

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface net.automatalib.graphs.SimpleGraph

net.automatalib.graphs.SimpleGraph.NormalGraphView<N,G extends net.automatalib.graphs.SimpleGraph<N>>

Field Summary

Fields inherited from class de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree

oracle, root

Constructor Summary

Constructors

Constructor and Description
DTree(DTNode<I> root, MembershipOracle<I,Boolean> oracle)
DTree(MembershipOracle<I,Boolean> oracle)

Method Summary

Modifier and Type	Method and Description
DTNode<I>	sift(AccessSequenceProvider<I> asp)
DTNode<I>	sift(DTNode<I> start, AccessSequenceProvider<I> asp, boolean hard)
DTNode<I>	sift(DTNode<I> start, net.automatalib.words.Word<I> prefix)
DTNode<I>	sift(DTNode<I> start, net.automatalib.words.Word<I> as, boolean hard)

Methods inherited from class de.learnlib.datastructure.discriminationtree.model.AbstractDiscriminationTree

getNodes, getOutgoingEdges, getRoot, getTarget, getVisualizationHelper, lcaInfo, leastCommonAncestor, setOracle, sift

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface net.automatalib.graphs.Graph

asNormalGraph

Methods inherited from interface net.automatalib.graphs.IndefiniteGraph

adjacentTargetsIterator, adjacentTargetsStream, getAdjacentTargets, getEdgesBetween, outgoingEdges, outgoingEdgesIterator, outgoingEdgesStream

Methods inherited from interface net.automatalib.graphs.SimpleGraph

iterator, nodeIDs, nodesStream, size

Methods inherited from interface net.automatalib.graphs.IndefiniteSimpleGraph

adjacentTargets, createDynamicNodeMapping, createStaticNodeMapping, isConnected

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Detail

DTree

public DTree(MembershipOracle<I,Boolean> oracle)

DTree

public DTree(DTNode<I> root,
             MembershipOracle<I,Boolean> oracle)

Method Detail

sift

public DTNode<I> sift(DTNode<I> start,
                      net.automatalib.words.Word<I> prefix)

Specified by:

sift in class AbstractDiscriminationTree<ContextPair<I>,I,Boolean,HypLoc<I>,DTNode<I>>

sift

public DTNode<I> sift(DTNode<I> start,
                      net.automatalib.words.Word<I> as,
                      boolean hard)

sift

public DTNode<I> sift(AccessSequenceProvider<I> asp)

sift

public DTNode<I> sift(DTNode<I> start,
                      AccessSequenceProvider<I> asp,
                      boolean hard)