net.automatalib.incremental.dfa

Class IncrementalDFABuilder<I>

java.lang.Object

net.automatalib.ts.abstractimpl.AbstractTS<S,I,T>

net.automatalib.ts.abstractimpl.AbstractDTS<S,I,T>

net.automatalib.automata.abstractimpl.AbstractDeterministicAutomaton<net.automatalib.incremental.dfa.State,I,net.automatalib.incremental.dfa.State>

net.automatalib.incremental.dfa.AbstractIncrementalDFABuilder<I>

net.automatalib.incremental.dfa.IncrementalDFABuilder<I>

Type Parameters:

I - input symbol class

All Implemented Interfaces:

Iterable<net.automatalib.incremental.dfa.State>, Automaton<net.automatalib.incremental.dfa.State,I,net.automatalib.incremental.dfa.State>, DeterministicAutomaton<net.automatalib.incremental.dfa.State,I,net.automatalib.incremental.dfa.State>, SimpleAutomaton<net.automatalib.incremental.dfa.State,I>, SimpleDeterministicAutomaton<net.automatalib.incremental.dfa.State,I>, DOTPlottableGraph<net.automatalib.incremental.dfa.State,net.automatalib.incremental.dfa.EdgeRecord>, Graph<net.automatalib.incremental.dfa.State,net.automatalib.incremental.dfa.EdgeRecord>, IndefiniteGraph<net.automatalib.incremental.dfa.State,net.automatalib.incremental.dfa.EdgeRecord>, UniversalGraph<net.automatalib.incremental.dfa.State,net.automatalib.incremental.dfa.EdgeRecord,Acceptance,I>, UniversalIndefiniteGraph<net.automatalib.incremental.dfa.State,net.automatalib.incremental.dfa.EdgeRecord,Acceptance,I>, IncrementalConstruction<DFA<?,I>,I>, DeterministicTransitionSystem<net.automatalib.incremental.dfa.State,I,net.automatalib.incremental.dfa.State>, SimpleDTS<net.automatalib.incremental.dfa.State,I>, SimpleTS<net.automatalib.incremental.dfa.State,I>, TransitionSystem<net.automatalib.incremental.dfa.State,I,net.automatalib.incremental.dfa.State>

public class IncrementalDFABuilder<I>
extends AbstractIncrementalDFABuilder<I>

Incrementally builds an (acyclic) DFA, from a set of positive and negative words. Using 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).

Author:

Malte Isberner

Field Summary

Fields inherited from class net.automatalib.incremental.dfa.AbstractIncrementalDFABuilder

alphabetSize, init, inputAlphabet, register, sink

Constructor Summary

Constructors

Constructor and Description
IncrementalDFABuilder(Alphabet<I> inputAlphabet) Constructor.

Method Summary

Modifier and Type	Method and Description
protected net.automatalib.incremental.dfa.State	getState(Word<I> word) Retrieves the state reached by a given word.
void	insert(Word<I> word, boolean accepting) Inserts a word into either the set of accepted or rejected words.
Acceptance	lookup(Word<I> word) Checks the ternary acceptance status for a given word.

Methods inherited from class net.automatalib.incremental.dfa.AbstractIncrementalDFABuilder

clone, clone, clone, createDynamicNodeMapping, createStaticNodeMapping, findSeparatingWord, getEdgeProperty, getGraphDOTHelper, getInitialState, getInputAlphabet, getNodeProperty, getNodes, getOutgoingEdges, getStates, getSuccessor, getTarget, getTransition, hasDefinitiveInformation, insert, nodeIDs, replaceOrRegister, replaceOrRegister, size, toAutomaton, updateInitSignature, updateInitSignature, updateSignature, updateSignature, updateSignature

Methods inherited from class net.automatalib.automata.abstractimpl.AbstractDeterministicAutomaton

iterator, stateIDs

Methods inherited from class net.automatalib.ts.abstractimpl.AbstractDTS

getInitialStates, getInitialStates, getState, getState, getSuccessor, getSuccessor, getSuccessor, getSuccessor, getTransitions, getTransitions

Methods inherited from class net.automatalib.ts.abstractimpl.AbstractTS

createDynamicStateMapping, createDynamicStateMapping, createStaticStateMapping, createStaticStateMapping, getStates, getStates, getSuccessors, getSuccessors, getSuccessors, getSuccessors, getSuccessors, getSuccessors, powersetView, powersetView

Methods inherited from class java.lang.Object

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

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Methods inherited from interface net.automatalib.ts.TransitionSystem

getTransitions, powersetView

Methods inherited from interface net.automatalib.ts.simple.SimpleDTS

getState, getSuccessor, getSuccessor

Methods inherited from interface net.automatalib.ts.simple.SimpleTS

createDynamicStateMapping, createStaticStateMapping, getInitialStates, getStates, getSuccessors, getSuccessors, getSuccessors

Constructor Detail

IncrementalDFABuilder

public IncrementalDFABuilder(Alphabet<I> inputAlphabet)

Constructor. Initializes the incremental builder.

Parameters:

inputAlphabet - the input alphabet to use

Method Detail

lookup

public Acceptance lookup(Word<I> word)

Checks the ternary acceptance status for a given word.

Specified by:

lookup in class AbstractIncrementalDFABuilder<I>

Parameters:

word - the word to check

Returns:

the acceptance status for the given word

insert

public void insert(Word<I> word,
                   boolean accepting)

Inserts a word into either the set of accepted or rejected words.

Specified by:

insert in class AbstractIncrementalDFABuilder<I>

Parameters:

word - the word to insert

accepting - whether to insert this word into the set of accepted or rejected words.

getState

protected net.automatalib.incremental.dfa.State getState(Word<I> word)

Retrieves the state reached by a given word.

Specified by:

getState in class AbstractIncrementalDFABuilder<I>

Parameters:

word - the word

Returns:

the state reached by the given word, or null if no state is reachable by that word