@ParametersAreNonnullByDefault public final class CharacterizingSets extends Object
A characterizing set for a whole automaton is a set W of words such that for every two states s1 and s2, there exists a word w ∈ W such that w exposes a difference between s1 and s2 (i.e., either covers a transition with differing property (or not defined in only one case), or reaching a successor state with differing properties), or there exists no such word at all.
A characterizing set for a single state s is a set W of words such that for every state t, there exists a word w ∈ W such that w exposes a difference between s and t, or there exists no such word at all.
| Modifier and Type | Method and Description |
|---|---|
static <S,I,T> Iterator<Word<I>> |
characterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs) |
static <S,I,T> void |
findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <S,I,T> void |
findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a specified state in the given automaton.
|
static <S,I,T> boolean |
findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes,
Collection<? super Word<I>> newSuffixes) |
static <S,I,T> Iterator<Word<I>> |
incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldSuffixes) |
public static <S,I,T> void findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> result)
automaton - the automaton for which to determine the characterizing set.inputs - the input alphabets to considerresult - the collection in which to store the characterizing wordspublic static <S,I,T> void findCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton, Collection<? extends I> inputs, S state, Collection<? super Word<I>> result)
automaton - the automaton containing the stateinputs - the input alphabets to considerstate - the state for which to determine the characterizing setresult - the collection in which to store the characterizing wordspublic static <S,I,T> Iterator<Word<I>> characterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton, Collection<? extends I> inputs)
public static <S,I,T> boolean findIncrementalCharacterizingSet(UniversalDeterministicAutomaton<S,I,T,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes, Collection<? super Word<I>> newSuffixes)
public static <S,I,T> Iterator<Word<I>> incrementalCharacterizingSetIterator(UniversalDeterministicAutomaton<S,I,T,?,?> automaton, Collection<? extends I> inputs, Collection<? extends Word<I>> oldSuffixes)
Copyright © 2019. All rights reserved.