de.learnlib.algorithms.kv.dfa

Class KearnsVaziraniDFA<I>

java.lang.Object

de.learnlib.algorithms.kv.dfa.KearnsVaziraniDFA<I>

Type Parameters:

I - input symbol type

All Implemented Interfaces:

LearningAlgorithm<DFA<?,I>,I,Boolean>, LearningAlgorithm.DFALearner<I>, Resumable<KearnsVaziraniDFAState<I>>, SupportsGrowingAlphabet<I>

public class KearnsVaziraniDFA<I>
extends Object
implements LearningAlgorithm.DFALearner<I>, SupportsGrowingAlphabet<I>, Resumable<KearnsVaziraniDFAState<I>>

The Kearns/Vazirani algorithm for learning DFA, as described in the book "An Introduction to Computational Learning Theory" by Michael Kearns and Umesh Vazirani.

Author:

Malte Isberner

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	KearnsVaziraniDFA.BuilderDefaults
protected class	KearnsVaziraniDFA.KVAbstractCounterexample

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

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

Field Summary

Fields

Modifier and Type	Field and Description
protected BinaryDTree<I,StateInfo<I,Boolean>>	discriminationTree
protected List<StateInfo<I,Boolean>>	stateInfos

Constructor Summary

Constructors

Constructor and Description
KearnsVaziraniDFA(Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, boolean repeatedCounterexampleEvaluation, AcexAnalyzer counterexampleAnalyzer) Constructor.

Method Summary

Modifier and Type	Method and Description
void	addAlphabetSymbol(I symbol)
BinaryDTree<I,StateInfo<I,Boolean>>	getDiscriminationTree()
DFA<?,I>	getHypothesisModel()
boolean	refineHypothesis(DefaultQuery<I,Boolean> ceQuery)
void	resume(KearnsVaziraniDFAState<I> state)
void	startLearning()
KearnsVaziraniDFAState<I>	suspend()

Methods inherited from class java.lang.Object

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

Field Detail

discriminationTree

protected BinaryDTree<I,StateInfo<I,Boolean>> discriminationTree

stateInfos

protected List<StateInfo<I,Boolean>> stateInfos

Constructor Detail

KearnsVaziraniDFA

public KearnsVaziraniDFA(Alphabet<I> alphabet,
                         MembershipOracle<I,Boolean> oracle,
                         boolean repeatedCounterexampleEvaluation,
                         AcexAnalyzer counterexampleAnalyzer)

Constructor.

Parameters:

alphabet - the learning alphabet

oracle - the membership oracle

Method Detail

startLearning

public void startLearning()

Specified by:

startLearning in interface LearningAlgorithm<DFA<?,I>,I,Boolean>

refineHypothesis

public boolean refineHypothesis(DefaultQuery<I,Boolean> ceQuery)

Specified by:

refineHypothesis in interface LearningAlgorithm<DFA<?,I>,I,Boolean>

getHypothesisModel

public DFA<?,I> getHypothesisModel()

Specified by:

getHypothesisModel in interface LearningAlgorithm<DFA<?,I>,I,Boolean>

getDiscriminationTree

public BinaryDTree<I,StateInfo<I,Boolean>> getDiscriminationTree()

addAlphabetSymbol

public void addAlphabetSymbol(I symbol)

Specified by:

addAlphabetSymbol in interface SupportsGrowingAlphabet<I>

suspend

public KearnsVaziraniDFAState<I> suspend()

Specified by:

suspend in interface Resumable<KearnsVaziraniDFAState<I>>

resume

public void resume(KearnsVaziraniDFAState<I> state)

Specified by:

resume in interface Resumable<KearnsVaziraniDFAState<I>>