I
- input symbol type upper boundD
- output domain type upper boundpublic interface GlobalSuffixFinder<I,D>
Please note that the type parameters of these class only constitute upper bounds for the respective input
symbol and output classes, denoting the requirements of the process in general. A suffix finder which does not
exploit any properties of the used classes will implement this interface with <Object,Object> generic
arguments only. The genericity is still maintained due to the RI and RO generic parameters in the
findSuffixes(Query, AccessSequenceTransformer, SuffixOutput, MembershipOracle)
method.
Modifier and Type | Method and Description |
---|---|
<RI extends I,RD extends D> |
findSuffixes(Query<RI,RD> ceQuery,
AccessSequenceTransformer<RI> asTransformer,
net.automatalib.automata.concepts.SuffixOutput<RI,RD> hypOutput,
MembershipOracle<RI,RD> oracle)
Finds a set of distinguishing suffixes which will allow to expose at least one additional state in the
hypothesis.
|
<RI extends I,RD extends D> List<net.automatalib.words.Word<RI>> findSuffixes(Query<RI,RD> ceQuery, AccessSequenceTransformer<RI> asTransformer, net.automatalib.automata.concepts.SuffixOutput<RI,RD> hypOutput, MembershipOracle<RI,RD> oracle)
RI
- real input symbol type used for *this* counterexample analysisRD
- real output domain type used for *this* counterexample analysisceQuery
- the counterexample query that triggered the refinement. Note that the same restrictions as in LearningAlgorithm.refineHypothesis(DefaultQuery)
apply.asTransformer
- an AccessSequenceTransformer
used for access sequence transformation, if applicable.hypOutput
- interface to the output generation of the hypothesis, with the aim of comparing outputs of the hypothesis
and the SUL.oracle
- interface to the System Under Learning (SUL).Copyright © 2018. All rights reserved.