I
- input symbol classpublic class IncrementalDFADAGBuilder<I> extends AbstractIncrementalDFADAGBuilder<I>
insert(Word,
boolean)
, either the set of words definitely in the target language or definitely not in the target language
is augmented. The lookup(Word)
method then returns, for a given word, whether this word is in the set of
definitely accepted words (Acceptance.TRUE
), definitely rejected words (Acceptance.FALSE
), or neither
(Acceptance.DONT_KNOW
).AbstractIncrementalDFADAGBuilder.GraphView, AbstractIncrementalDFADAGBuilder.TransitionSystemView
AbstractIncrementalDFABuilder.AbstractGraphView<I,N,E>, AbstractIncrementalDFABuilder.AbstractTransitionSystemView<S,I,T>
init, register, sink
alphabetSize, inputAlphabet
Constructor and Description |
---|
IncrementalDFADAGBuilder(Alphabet<I> inputAlphabet)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
protected @Nullable net.automatalib.incremental.dfa.dag.State |
getState(Word<? extends I> word)
Retrieves the state reached by a given word.
|
void |
insert(Word<? extends I> word,
boolean accepting)
Inserts a word into either the set of accepted or rejected words.
|
Acceptance |
lookup(Word<? extends I> word)
Checks the ternary acceptance status for a given word.
|
addAlphabetSymbol, asGraph, asTransitionSystem, clone, clone, clone, findSeparatingWord, hiddenClone, hide, replaceOrRegister, replaceOrRegister, unhide, unhide, updateInitSignature, updateInitSignature, updateInitSignature, updateSignature, updateSignature, updateSignature
getInputAlphabet, hasDefinitiveInformation, insert
public Acceptance lookup(Word<? extends I> word)
word
- the word to checkpublic void insert(Word<? extends I> word, boolean accepting)
word
- the word to insertaccepting
- whether to insert this word into the set of accepted or rejected words.protected @Nullable net.automatalib.incremental.dfa.dag.State getState(Word<? extends I> word)
getState
in class AbstractIncrementalDFADAGBuilder<I>
word
- the wordnull
if no state is reachable by that wordCopyright © 2020. All rights reserved.