public class NearLinearEquivalenceTest<I> extends Object
Constructor and Description |
---|
NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> target) |
Modifier and Type | Method and Description |
---|---|
Word<I> |
findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
Collection<? extends I> inputs) |
static <S,I,T> Word<I> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
S init1,
S init2,
Collection<? extends I> inputs) |
static <S,I,T> 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> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Alphabet<I> inputs) |
static <S,S2,I,T,T2> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Alphabet<I> inputs,
boolean ignoreUndefinedTransitions) |
static <S,S2,I,T,T2> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs) |
static <S,S2,I,T,T2> |
findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
Collection<? extends I> inputs,
boolean ignoreUndefinedTransitions) |
public NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> target)
public static <S,I,T> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs)
public static <S,I,T> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, S init1, S init2, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
S
- automaton state typeI
- input alphabet typeT
- automaton transition typetarget
- the automatoninit1
- the first stateinit2
- the second stateinputs
- the inputs to consider for a separating wordignoreUndefinedTransitions
- if true
, undefined transitions are not considered to distinguish two states, if false
an
undefined and defined transition are considered to distinguish two statesnull
if no such word can be foundpublic Word<I> findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other, Collection<? extends I> inputs)
public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Collection<? extends I> inputs)
public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Collection<? extends I> inputs, boolean ignoreUndefinedTransitions)
public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Alphabet<I> inputs)
public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Alphabet<I> inputs, boolean ignoreUndefinedTransitions)
Copyright © 2019. All rights reserved.