Modifier and Type | Method and Description |
---|---|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
and(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet)
Calculates the conjunction ("and") of two SEVPA, and returns the result as a new SEVPA.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
combine(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet,
AcceptanceCombiner combiner)
Most general way of combining two SEVPAs.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
equiv(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet)
Calculates the equivalence ("<=>") of two SEVPA, and stores the result in a given mutable SEVPA.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
impl(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet)
Calculates the implication ("=>") of two SEVPA, and stores the result in a given mutable SEVPA.
|
static <I> DefaultOneSEVPA<I> |
minimize(OneSEVPA<?,I> sevpa,
VPDAlphabet<I> alphabet)
Minimizes the given SEVPA over the given alphabet.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
or(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet)
Calculates the disjunction ("or") of two SEVPA, and returns the result as a new SEVPA.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
xor(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet)
Calculates the exclusive-or ("xor") of two SEVPA, and stores the result in a given mutable SEVPA.
|
public static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> and(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet)
sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetpublic static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> combine(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet, AcceptanceCombiner combiner)
AcceptanceCombiner
specified via the combiner
parameter specifies how acceptance values of the SEVPAs will be combined to an acceptance value in the result
SEVPAs.sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetcombiner
- combination method for acceptance valuespublic static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> or(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet)
sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetpublic static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> xor(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet)
sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetpublic static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> equiv(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet)
sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetpublic static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> impl(OneSEVPA<L1,I> sevpa1, OneSEVPA<L2,I> sevpa2, VPDAlphabet<I> alphabet)
sevpa1
- the first SEVPAsevpa2
- the second SEVPAalphabet
- the input alphabetpublic static <I> DefaultOneSEVPA<I> minimize(OneSEVPA<?,I> sevpa, VPDAlphabet<I> alphabet)
sevpa
- the SEVPA to be minimizedalphabet
- the input alphabet to consider for minimization (this will also be the input alphabet of the resulting
automaton)Copyright © 2020. All rights reserved.