I
- input symbol class.public class ExtensibleLStarDFA<I> extends ExtensibleAutomatonLStar<DFA<?,I>,I,Boolean,Integer,Integer,Boolean,Void,CompactDFA<I>> implements OTLearner.OTLearnerDFA<I>
ExtensibleAutomatonLStar.BuilderDefaults
OTLearner.OTLearnerDFA<I>, OTLearner.OTLearnerMealy<I,O>
LearningAlgorithm.DFALearner<I>, LearningAlgorithm.MealyLearner<I,O>
GlobalSuffixLearner.GlobalSuffixLearnerDFA<I>, GlobalSuffixLearner.GlobalSuffixLearnerMealy<I,O>
cexHandler, closingStrategy, initialPrefixes, initialSuffixes
internalHyp, stateInfos
alphabet, oracle, table
Constructor and Description |
---|
ExtensibleLStarDFA(Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
List<Word<I>> initialPrefixes,
List<Word<I>> initialSuffixes,
ObservationTableCEXHandler<? super I,? super Boolean> cexHandler,
ClosingStrategy<? super I,? super Boolean> closingStrategy) |
ExtensibleLStarDFA(Alphabet<I> alphabet,
MembershipOracle<I,Boolean> oracle,
List<Word<I>> initialSuffixes,
ObservationTableCEXHandler<? super I,? super Boolean> cexHandler,
ClosingStrategy<? super I,? super Boolean> closingStrategy)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
protected DFA<?,I> |
exposeInternalHypothesis() |
protected SuffixOutput<I,Boolean> |
hypothesisOutput() |
protected List<Word<I>> |
initialSuffixes()
Returns the list of initial suffixes which are used to initialize the table.
|
protected Boolean |
stateProperty(Row<I> stateRow)
Derives a state property from the corresponding row.
|
protected Void |
transitionProperty(Row<I> stateRow,
int inputIdx)
Derives a transition property from the corresponding transition.
|
initialPrefixes, refineHypothesisInternal, selectClosingRows
createState, doRefineHypothesis, getHypothesisModel, setTransition, startLearning, updateInternalHypothesis
addGlobalSuffixes, analyzeInconsistency, completeConsistentTable, getGlobalSuffixes, getObservationTable, incorporateCounterExample, refineHypothesis
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
getHypothesisModel, refineHypothesis, startLearning
getObservationTable
public ExtensibleLStarDFA(Alphabet<I> alphabet, MembershipOracle<I,Boolean> oracle, List<Word<I>> initialSuffixes, ObservationTableCEXHandler<? super I,? super Boolean> cexHandler, ClosingStrategy<? super I,? super Boolean> closingStrategy)
alphabet
- the learning alphabet.oracle
- the DFA oracle.protected List<Word<I>> initialSuffixes()
AbstractLStar
initialSuffixes
in class ExtensibleAutomatonLStar<DFA<?,I>,I,Boolean,Integer,Integer,Boolean,Void,CompactDFA<I>>
protected Boolean stateProperty(Row<I> stateRow)
AbstractAutomatonLStar
stateProperty
in class AbstractAutomatonLStar<DFA<?,I>,I,Boolean,Integer,Integer,Boolean,Void,CompactDFA<I>>
stateRow
- the row for which the state is createdprotected Void transitionProperty(Row<I> stateRow, int inputIdx)
AbstractAutomatonLStar
N.B.: Not the transition row is passed to this method, but the
row for the outgoing state. The transition row can be retrieved
using Row.getSuccessor(int)
.
transitionProperty
in class AbstractAutomatonLStar<DFA<?,I>,I,Boolean,Integer,Integer,Boolean,Void,CompactDFA<I>>
stateRow
- the row for the source stateinputIdx
- the index of the input symbol to considerprotected DFA<?,I> exposeInternalHypothesis()
exposeInternalHypothesis
in class AbstractAutomatonLStar<DFA<?,I>,I,Boolean,Integer,Integer,Boolean,Void,CompactDFA<I>>
protected SuffixOutput<I,Boolean> hypothesisOutput()
hypothesisOutput
in class AbstractLStar<DFA<?,I>,I,Boolean>
Copyright © 2015. All rights reserved.