Interface ADTNode<S,I,O>

Type Parameters:
S - (hypothesis) state type
I - input alphabet type
O - output alphabet type
All Superinterfaces:
FiniteRepresentation, Graph<ADTNode<S,I,O>,ADTNode<S,I,O>>, IndefiniteGraph<ADTNode<S,I,O>,ADTNode<S,I,O>>, IndefiniteSimpleGraph<ADTNode<S,I,O>>, Iterable<ADTNode<S,I,O>>, RecursiveADSNode<S,I,O,ADTNode<S,I,O>>, SimpleGraph<ADTNode<S,I,O>>
All Known Implementing Classes:
ADTLeafNode, ADTResetNode, ADTSymbolNode

public interface ADTNode<S,I,O> extends RecursiveADSNode<S,I,O,ADTNode<S,I,O>>
The ADT equivalent of ADSNode. In contrast to regular adaptive distinguishing sequences, an ADT node may also represent a reset node that semantically separates multiple ADSs.