Package de.learnlib.algorithm.adt.api
Interface SubtreeReplacer
-
- All Known Implementing Classes:
ExhaustiveReplacer
,LevelOrderReplacer
,SingleReplacer
public interface SubtreeReplacer
Interface for configuration objects that specify how nodes of the current ADT should be replaced.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description <S,I,O>
Set<ReplacementResult<S,I,O>>computeReplacements(MealyMachine<S,I,?,O> hypothesis, Alphabet<I> inputs, ADT<S,I,O> adt)
Compute how certain nodes of the ADT should be replaced.
-
-
-
Method Detail
-
computeReplacements
<S,I,O> Set<ReplacementResult<S,I,O>> computeReplacements(MealyMachine<S,I,?,O> hypothesis, Alphabet<I> inputs, ADT<S,I,O> adt)
Compute how certain nodes of the ADT should be replaced. It is assumed, the replacements are well-defined (i.e. each replaced node belongs to a distinct subtree).Currently only replacements in the form of an ADS (i.e. no reset nodes) are supported.
- Type Parameters:
S
- (hypothesis) state typeI
- input alphabet typeO
- output alphabet type- Parameters:
hypothesis
- the current hypothesis (without any undefined transitions)inputs
- the input alphabetadt
- the current adaptive discrimination tree- Returns:
- A
Set
of proposed replacements
-
-