Modifier and Type | Class and Description |
---|---|
class |
ADTState<I,O>
Hypothesis state model.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractHypTrans<I> |
class |
HypIntTrans<I> |
class |
HypLoc<I> |
class |
HypRetTrans<I> |
Modifier and Type | Method and Description |
---|---|
DTNode<I> |
DTree.sift(AccessSequenceProvider<I> asp) |
DTNode<I> |
DTree.sift(DTNode<I> start,
AccessSequenceProvider<I> asp,
boolean hard) |
Modifier and Type | Method and Description |
---|---|
protected Boolean |
AbstractVPDALearner.query(AccessSequenceProvider<I> asp,
ContextPair<I> context) |
Modifier and Type | Class and Description |
---|---|
class |
TTTState<I,D>
A state in a
AbstractTTTHypothesis . |
class |
TTTTransition<I,D>
A transition in a
AbstractTTTHypothesis . |
Modifier and Type | Method and Description |
---|---|
protected D |
AbstractTTTLearner.query(AccessSequenceProvider<I> accessSeqProvider,
net.automatalib.words.Word<I> suffix)
Performs a membership query, using an access sequence as its prefix.
|
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AbstractBaseDTNode<I,D> start,
AccessSequenceProvider<I> asp,
boolean hard) |
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AccessSequenceProvider<I> asp)
Sifts an access sequence provided by an object into the tree, starting at the root.
|
AbstractBaseDTNode<I,D> |
BaseTTTDiscriminationTree.sift(AccessSequenceProvider<I> asp,
boolean hard)
Sifts an access sequence provided by an object into the tree, starting at the root.
|
Modifier and Type | Class and Description |
---|---|
class |
TTTStateDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
TTTTransitionMealy<I,O> |
Copyright © 2018. All rights reserved.