de.learnlib.algorithms.adt.config.model.replacer

Class LevelOrderReplacer

java.lang.Object

de.learnlib.algorithms.adt.config.model.replacer.LevelOrderReplacer

All Implemented Interfaces:

SubtreeReplacer

public class LevelOrderReplacer
extends Object
implements SubtreeReplacer

Author:

frohme

Constructor Summary

Constructors

Constructor and Description
LevelOrderReplacer(ADSCalculator adsProvider)

Method Summary

Modifier and Type	Method and 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.

Methods inherited from class java.lang.Object

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

Constructor Detail

LevelOrderReplacer

public LevelOrderReplacer(ADSCalculator adsProvider)

Method Detail

computeReplacements

public <S,I,O> Set<ReplacementResult<S,I,O>> computeReplacements(MealyMachine<S,I,?,O> hypothesis,
                                                                 Alphabet<I> inputs,
                                                                 ADT<S,I,O> adt)

Description copied from interface: SubtreeReplacer

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.

Specified by:

computeReplacements in interface SubtreeReplacer

Type Parameters:

S - (hypothesis) state type

I - input alphabet type

O - output alphabet type

Parameters:

hypothesis - the current hypothesis (without any undefined transitions)

inputs - the input alphabet

adt - the current adaptive discrimination tree

Returns:

A Set of proposed replacements