net.automatalib.util.automata.equivalence

Class NearLinearEquivalenceTest<I>

java.lang.Object

net.automatalib.util.automata.equivalence.NearLinearEquivalenceTest<I>

public class NearLinearEquivalenceTest<I>
extends Object

Constructor Summary

Constructors

Constructor and Description
NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> target)

Method Summary

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> Word<I>	findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Alphabet<I> inputs)
static <S,S2,I,T,T2> Word<I>	findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target, UniversalDeterministicAutomaton<S2,I,T2,?,?> other, Collection<? extends I> inputs)

Methods inherited from class java.lang.Object

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

Constructor Detail

NearLinearEquivalenceTest

public NearLinearEquivalenceTest(UniversalDeterministicAutomaton<?,I,?,?,?> target)

Method Detail

findSeparatingWord

public static <S,I,T> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
                                                 S init1,
                                                 S init2,
                                                 Collection<? extends I> inputs)

findSeparatingWord

public 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.

Type Parameters:

S - automaton state type

I - input alphabet type

T - automaton transition type

Parameters:

target - the automaton

init1 - the first state

init2 - the second state

inputs - the inputs to consider for a separating word

ignoreUndefinedTransitions - if true, undefined transitions are not considered to distinguish two states, if false 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 Word<I> findSeparatingWord(UniversalDeterministicAutomaton<?,I,?,?,?> other,
                                  Collection<? extends I> inputs)

findSeparatingWord

public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
                                                       UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
                                                       Collection<? extends I> inputs)

findSeparatingWord

public static <S,S2,I,T,T2> Word<I> findSeparatingWord(UniversalDeterministicAutomaton<S,I,T,?,?> target,
                                                       UniversalDeterministicAutomaton<S2,I,T2,?,?> other,
                                                       Alphabet<I> inputs)