static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.and(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet) |
Returns a view on the conjunction ("and") of two OneSEVPAs. |
static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.combine(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet,
AcceptanceCombiner combiner) |
Most general way of combining two OneSEVPAs. |
static <L,I>
@Nullable Word<I> |
OneSEVPAs.computeAccessSequence(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet,
Predicate<? super L> predicate) |
Computes an access sequence over the given alphabet (if existent) such that it reaches a location of the given
SEVPA that satisfies the given predicate.
|
static <L,I>
ArrayStorage<Word<I>> |
OneSEVPAs.computeAccessSequences(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet) |
Computes all access sequences over the given alphabet (if existent) to the locations of the given SEVPA.
|
static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.equiv(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet) |
Returns a view on the equivalence ("<=>") of two OneSEVPAs. |
static <L,I>
@Nullable Word<I> |
OneSEVPAs.findAcceptedWord(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet) |
Returns a well-matched word (over the given alphabet) that is accepted by the given SEVPA, if existent.
|
static <L,I>
Collection<Pair<Word<I>,Word<I>>> |
OneSEVPAs.findCharacterizingSet(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet) |
Computes a characterizing set for the given SEVPA.
|
static <L,I>
List<L> |
OneSEVPAs.findReachableLocations(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet) |
Returns a list of locations that are reachable from the initial location of the given SEVPA via symbols of the
given alphabet.
|
static <L,I>
@Nullable Word<I> |
OneSEVPAs.findRejectedWord(OneSEVPA<L,I> sevpa,
VPAlphabet<I> alphabet) |
Returns a well-matched word (over the given alphabet) that is rejected by the given SEVPA, if existent.
|
static <I> @Nullable Word<I> |
OneSEVPAs.findSeparatingWord(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPAlphabet<I> alphabet) |
Finds a separating word for two SEVPAs, if existent.
|
static <L,I>
@Nullable Pair<Word<I>,Word<I>> |
OneSEVPAs.findSeparatingWord(OneSEVPA<L,I> sevpa,
L init1,
L init2,
VPAlphabet<I> alphabet) |
Finds a separating word for two locations of a SEVPAs, if existent.
|
static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.impl(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet) |
Returns a view on the implication ("=>") of two OneSEVPAs. |
static <I> DefaultOneSEVPA<I> |
OneSEVPAs.minimize(OneSEVPA<?,I> sevpa,
VPAlphabet<I> alphabet) |
Minimizes the given OneSEVPA over the given alphabet. |
static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.or(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet) |
Returns a view on the disjunction ("or") of two OneSEVPAs. |
static <I> boolean |
OneSEVPAs.testEquivalence(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPAlphabet<I> alphabet) |
Tests whether two SEVPAs are equivalent, i.e. whether there exists a
separating word for the two given SEVPAs. |
static <AI,CI>
net.automatalib.util.automaton.vpa.SPAConverter.ConversionResult<AI,CI> |
OneSEVPAs.toSPA(OneSEVPA<?,AI> sevpa,
VPAlphabet<AI> alphabet,
CI mainProcedure,
SymbolMapper<AI,CI> symbolMapper,
boolean minimize) |
Converts a given SEVPA into an SPA by concretizing the (abstract) behavior of the SEVPA into the (concrete)
behavior of an SPA which can be described by the copy-rule semantics of (instrumented) context-free grammars.
|
static <L1,L2,I>
OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.xor(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPAlphabet<I> alphabet) |
Returns a view on the exclusive-or ("xor") of two OneSEVPAs. |