Class NearLinearEquivalenceTest
- java.lang.Object
-
- net.automatalib.util.automaton.equivalence.NearLinearEquivalenceTest
-
public final class NearLinearEquivalenceTest extends Object
-
-
Method Summary
All Methods Static Methods Concrete Methods Modifier and Type Method Description static <I> @Nullable Word<I>
findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
static <I> @Nullable Word<I>
findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Alphabet<I> inputs)
static <S,I>
@Nullable Word<I>findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> target, S init1, S init2, Collection<? extends I> inputs)
static <S,I,T>
@Nullable Word<I>findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
Find a separating word for two states in a given automaton.static <S,S2,I,T,T2,SP,SP2,TP,TP2>
@Nullable Word<I>findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
static <S,S2,I,T,T2,SP,SP2,TP,TP2>
@Nullable Word<I>findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Alphabet<I> inputs, boolean ignoreUndefinedTransitions)
-
-
-
Method Detail
-
findSeparatingWord
public static <S,I> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,?,?,?> target, S init1, S init2, Collection<? extends I> inputs)
-
findSeparatingWord
public static <S,I,T> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
Find a separating word for two states in a given automaton.- Type Parameters:
S
- automaton state typeI
- input alphabet typeT
- automaton transition type- Parameters:
target
- the automatoninit1
- the first stateinit2
- the second stateinputs
- the inputs to consider for a separating wordignoreUndefinedTransitions
- iftrue
, undefined transitions are not considered to distinguish two states, iffalse
an undefined and defined transition are considered to distinguish two states- Returns:
- A word separating the two states,
null
if no such word can be found
-
findSeparatingWord
public static <I> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
-
findSeparatingWord
public static <S,S2,I,T,T2,SP,SP2,TP,TP2> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
-
findSeparatingWord
public static <I> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> target, UniversalDeterministicAutomaton<?,I,?,?,?> other, Alphabet<I> inputs)
-
findSeparatingWord
public static <S,S2,I,T,T2,SP,SP2,TP,TP2> @Nullable Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,SP,TP> target, UniversalDeterministicAutomaton<S2,I,T2,SP2,TP2> other, Alphabet<I> inputs, boolean ignoreUndefinedTransitions)
-
-