Constructor and Description |
---|
Automata() |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Graph<S,Pair<I,T>> |
asGraph(Automaton<S,I,T> automaton,
Collection<? extends I> inputs) |
static <S,I,T,SP,TP> |
asUniversalGraph(UniversalAutomaton<S,I,T,SP,TP> automaton,
Collection<? extends I> inputs) |
static <I> List<Word<I>> |
characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs)
Computes a characterizing set, and returns it as a
List . |
static <I> void |
characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> result)
Computes a characterizing set for the given automaton.
|
static <I> void |
cover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states,
Collection<? super Word<I>> transitions) |
static <I> Word<I> |
findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference,
UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs)
Finds a separating word for two automata.
|
static <S,I> Word<I> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
S state1,
S state2,
Collection<? extends I> inputs)
Finds a separating word for two states in an automaton.
|
static <S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
invasiveMinimize(A automaton,
Collection<? extends I> inputs) |
static <S,I,T,SP,TP,SO,TO,A extends MutableDeterministic<SO,? super I,TO,? super SP,? super TP>> |
minimize(UniversalDeterministicAutomaton<S,I,T,SP,TP> automaton,
Collection<? extends I> inputs,
A output) |
static <S,I> List<Word<I>> |
stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state)
Computes a characterizing set for a single state, and returns it as a
List . |
static <S,I> void |
stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton,
Collection<? extends I> inputs,
S state,
Collection<? super Word<I>> result)
Computes a characterizing set for a single state.
|
static <I> List<Word<I>> |
stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs) |
static <I> List<Word<I>> |
transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs) |
public Automata()
public static <S,I,T> Graph<S,Pair<I,T>> asGraph(Automaton<S,I,T> automaton, Collection<? extends I> inputs)
public static <S,I,T,SP,TP> UniversalGraph<S,Pair<I,T>,SP,Pair<I,TP>> asUniversalGraph(UniversalAutomaton<S,I,T,SP,TP> automaton, Collection<? extends I> inputs)
public static <S,I,T,SP,TP,SO,TO,A extends MutableDeterministic<SO,? super I,TO,? super SP,? super TP>> A minimize(UniversalDeterministicAutomaton<S,I,T,SP,TP> automaton, Collection<? extends I> inputs, A output)
public static <S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> A invasiveMinimize(A automaton, Collection<? extends I> inputs)
public static <I> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> reference, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
reference
- the one automaton to considerother
- the other automaton to considerinputs
- the input symbols to considerpublic static <S,I> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, S state1, S state2, Collection<? extends I> inputs)
automaton
- the automaton containing the statesstate1
- the one statestate2
- the other stateinputs
- the input symbols to considerpublic static <I> void characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> result)
This is a convenience method acting as a shortcut to
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton, Collection, Collection)
.
automaton
- the automaton for which to determine the characterizing setinputs
- the input symbols to considerresult
- the collection in which to store the characterizing wordsCharacterizingSets
public static <I> List<Word<I>> characterizingSet(UniversalDeterministicAutomaton<?,I,?,?,?> automaton, Collection<? extends I> inputs)
List
.automaton
- the automaton for which to determine the characterizing setinputs
- the input symbols to considerCharacterizingSets
public static <S,I> void stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state, Collection<? super Word<I>> result)
This is a convenience method acting as a shortcut to
CharacterizingSets.findCharacterizingSet(UniversalDeterministicAutomaton, Collection, Object, Collection)
.
automaton
- the automaton containing the stateinputs
- the input symbols to considerstate
- the state for which to determine a characterizing setresult
- the collection in which to store the characterizing wordsCharacterizingSets
public static <S,I> List<Word<I>> stateCharacterizingSet(UniversalDeterministicAutomaton<S,I,?,?,?> automaton, Collection<? extends I> inputs, S state)
List
.automaton
- the automaton containing the stateinputs
- the input symbols to considerstate
- the state for which to determine a characterizing setCharacterizingSets
public static <I> void cover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs, Collection<? super Word<I>> states, Collection<? super Word<I>> transitions)
public static <I> List<Word<I>> stateCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
public static <I> List<Word<I>> transitionCover(DeterministicAutomaton<?,I,?> automaton, Collection<? extends I> inputs)
Copyright © 2015. All Rights Reserved.