net.automatalib.incremental.dfa.tree

Class IncrementalDFATreeBuilder<I>

java.lang.Object

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

net.automatalib.incremental.dfa.tree.IncrementalDFATreeBuilder<I>

All Implemented Interfaces:

IncrementalDFABuilder<I>, IncrementalConstruction<DFA<?,I>,I>

Direct Known Subclasses:

IncrementalPCDFATreeBuilder

public class IncrementalDFATreeBuilder<I>
extends AbstractIncrementalDFABuilder<I>

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
class	IncrementalDFATreeBuilder.GraphView
protected static class	IncrementalDFATreeBuilder.Record<S,I>
class	IncrementalDFATreeBuilder.TransitionSystemView

Nested classes/interfaces inherited from class net.automatalib.incremental.dfa.AbstractIncrementalDFABuilder

AbstractIncrementalDFABuilder.AbstractGraphView<I,N,E>, AbstractIncrementalDFABuilder.AbstractTransitionSystemView<S,I,T>

Field Summary

Fields

Modifier and Type	Field and Description
protected Node<I>	root

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

alphabetSize, inputAlphabet

Constructor Summary

Constructors

Constructor and Description
IncrementalDFATreeBuilder(Alphabet<I> inputAlphabet)

Method Summary

Methods

Modifier and Type	Method and Description
IncrementalDFATreeBuilder.GraphView	asGraph() Retrieves a graph view of the current state of the construction.
IncrementalDFATreeBuilder.TransitionSystemView	asTransitionSystem() Retrieves a transition system view of the current state of the construction.
protected <S> Word<I>	doFindSeparatingWord(DFA<S,I> target, Collection<? extends I> inputs, boolean omitUndefined)
Word<I>	findSeparatingWord(DFA<?,I> target, Collection<? extends I> inputs, boolean omitUndefined) Checks the current state of the construction against a given target model, and returns a word exposing a difference if there is one.
void	insert(Word<? extends I> word, boolean acceptance) Inserts a new word into the automaton, with a given acceptance value.
Acceptance	lookup(Word<? extends I> inputWord) Looks up the tri-state acceptance value for a given word.

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

getInputAlphabet, hasDefinitiveInformation, insert

Methods inherited from class java.lang.Object

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

Field Detail

root

@Nonnull
protected final Node<I> root

Constructor Detail

IncrementalDFATreeBuilder

public IncrementalDFATreeBuilder(Alphabet<I> inputAlphabet)

Method Detail

findSeparatingWord

@Nullable
public Word<I> findSeparatingWord(DFA<?,I> target,
                                  Collection<? extends I> inputs,
                                  boolean omitUndefined)

Description copied from interface: IncrementalConstruction

Checks the current state of the construction against a given target model, and returns a word exposing a difference if there is one.

Parameters:

target - the target automaton model

inputs - the set of input symbols to consider

omitUndefined - if this is set to true, then undefined transitions in the target model will be interpreted as "unspecified/don't know" and omitted in the equivalence test. Otherwise, they will be interpreted in the usual manner (e.g., non-accepting sink in case of DFAs).

Returns:

a separating word, or null if no difference could be found.

asGraph

public IncrementalDFATreeBuilder.GraphView asGraph()

Description copied from interface: IncrementalConstruction

Retrieves a graph view of the current state of the construction. The graph model should be backed by the construction, i.e., subsequent changes will be reflected in the graph model.

Returns:

a graph view on the current state of the construction

asTransitionSystem

public IncrementalDFATreeBuilder.TransitionSystemView asTransitionSystem()

Description copied from interface: IncrementalConstruction

Retrieves a transition system view of the current state of the construction. The transition system model should be backed by the construction, i.e., subsequent changes will be reflected in the transition system.

Returns:

a transition system view on the current state of the construction

lookup

public Acceptance lookup(Word<? extends I> inputWord)

Description copied from interface: IncrementalDFABuilder

Looks up the tri-state acceptance value for a given word.

Parameters:

inputWord - the word

Returns:

the tri-state acceptance value for this word.

insert

public void insert(Word<? extends I> word,
          boolean acceptance)

Description copied from interface: IncrementalDFABuilder

Inserts a new word into the automaton, with a given acceptance value.

Parameters:

word - the word to insert

acceptance - whether or not this word should be marked as accepting

doFindSeparatingWord

protected <S> Word<I> doFindSeparatingWord(DFA<S,I> target,
                               Collection<? extends I> inputs,
                               boolean omitUndefined)