Package de.learnlib.algorithm.oml.ttt.mealy

Class OptimalTTTMealy<I,O>

java.lang.Object

de.learnlib.algorithm.oml.ttt.AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

de.learnlib.algorithm.oml.ttt.mealy.OptimalTTTMealy<I,O>

All Implemented Interfaces:

LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>, LearningAlgorithm.MealyLearner<I,O>, SupportsGrowingAlphabet<I>, InputAlphabetHolder<I>

Direct Known Subclasses:

OptimalTTTAdapterMealy

public class OptimalTTTMealy<I,O>
extends AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>
implements LearningAlgorithm.MealyLearner<I,O>

Nested Class Summary

Nested classes/interfaces inherited from interface de.learnlib.algorithm.LearningAlgorithm

LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>, LearningAlgorithm.MooreLearner<I,O>, LearningAlgorithm.NFALearner<I>

Field Summary

Fields inherited from class de.learnlib.algorithm.oml.ttt.AbstractOptimalTTT

ptree, strie

Constructor Summary

Constructors

Constructor	Description
OptimalTTTMealy(Alphabet<I> alphabet, MembershipOracle<I,Word<O>> mqo)
OptimalTTTMealy(Alphabet<I> alphabet, MembershipOracle<I,Word<O>> mqs, MembershipOracle<I,Word<O>> ceqs)

Method Summary

Modifier and Type	Method	Description
protected AbstractDecisionTree<I,Word<O>>	dtree()
MealyMachine<?,I,?,O>	getHypothesisModel()	Returns the current hypothesis model.
protected DTLeaf<I,Word<O>>	getState(Word<I> prefix)
protected Word<O>	hypOutput(Word<I> word, int length)
protected boolean	isCanonical()
protected int	maxSearchIndex(int ceLength)
protected Word<O>	suffix(Word<O> output, int length)

Methods inherited from class de.learnlib.algorithm.oml.ttt.AbstractOptimalTTT

addAlphabetSymbol, getInputAlphabet, refineHypothesis, startLearning

Methods inherited from class java.lang.Object

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

Methods inherited from interface de.learnlib.algorithm.LearningAlgorithm

refineHypothesis, startLearning

Constructor Detail

OptimalTTTMealy

public OptimalTTTMealy(Alphabet<I> alphabet,
                       MembershipOracle<I,Word<O>> mqo)

OptimalTTTMealy

public OptimalTTTMealy(Alphabet<I> alphabet,
                       MembershipOracle<I,Word<O>> mqs,
                       MembershipOracle<I,Word<O>> ceqs)

Method Detail

maxSearchIndex

protected int maxSearchIndex(int ceLength)

Specified by:

maxSearchIndex in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

hypOutput

protected Word<O> hypOutput(Word<I> word,
                            int length)

Specified by:

hypOutput in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

getState

protected DTLeaf<I,Word<O>> getState(Word<I> prefix)

Specified by:

getState in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

getHypothesisModel

public MealyMachine<?,I,?,O> getHypothesisModel()

Description copied from interface: LearningAlgorithm

Returns the current hypothesis model.

N.B.: By the contract of this interface, the model returned by this method may not be modified (i.e., M generally should refer to an immutable interface), and its validity is retained only until the next invocation of LearningAlgorithm.refineHypothesis(DefaultQuery). If older hypotheses have to be maintained, a copy of the returned model must be made.

Please note that it should be illegal to invoke this method before an initial invocation of LearningAlgorithm.startLearning().

Specified by:

getHypothesisModel in interface LearningAlgorithm<MealyMachine<?,I,?,O>,I,Word<O>>

Returns:

the current hypothesis model.

dtree

protected AbstractDecisionTree<I,Word<O>> dtree()

Specified by:

dtree in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

suffix

protected Word<O> suffix(Word<O> output,
                         int length)

Specified by:

suffix in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>

isCanonical

protected boolean isCanonical()

Specified by:

isCanonical in class AbstractOptimalTTT<MealyMachine<?,I,?,O>,I,Word<O>>