Modifier and Type | Field and Description |
---|---|
protected VPDAlphabet<I> |
AbstractOneSEVPA.alphabet |
Modifier and Type | Method and Description |
---|---|
VPDAlphabet<I> |
AbstractOneSEVPA.getAlphabet() |
Constructor and Description |
---|
AbstractOneSEVPA(VPDAlphabet<I> alphabet) |
DefaultOneSEVPA(VPDAlphabet<I> alphabet) |
DefaultOneSEVPA(VPDAlphabet<I> alphabet,
int capacity) |
Location(VPDAlphabet<?> alphabet,
int index,
boolean accepting) |
Modifier and Type | Method and Description |
---|---|
static <I> Word<I> |
Automata.findSeparatingWord(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> inputs) |
static <I> boolean |
Automata.testEquivalence(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <I> DefaultOneSEVPA<I> |
RandomAutomata.randomOneSEVPA(Random r,
int locCount,
VPDAlphabet<I> alphabet,
double acceptanceProb,
double initialRetTransProb,
boolean minimize) |
Modifier and Type | Method and Description |
---|---|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.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> |
OneSEVPAs.combine(OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
VPDAlphabet<I> alphabet,
AcceptanceCombiner combiner)
Most general way of combining two SEVPAs.
|
static <L,I> Word<I> |
OneSEVPAUtil.computeAccessSequence(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet,
Predicate<? super L> predicate) |
static <L,I> RichArray<Word<I>> |
OneSEVPAUtil.computeAccessSequences(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <L,I> OneSEVPAUtil.ReachResult<L,I> |
OneSEVPAUtil.computeAccessSequences(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet,
boolean computeAs,
Predicate<? super L> terminatePred) |
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.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 <L,I> Word<I> |
OneSEVPAUtil.findAcceptedWord(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <L,I> List<L> |
OneSEVPAUtil.findReachableLocations(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <L,I> Word<I> |
OneSEVPAUtil.findRejectedWord(OneSEVPA<L,I> sevpa,
VPDAlphabet<I> alphabet) |
static <I> Word<I> |
OneSEVPAUtil.findSeparatingWord(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> alphabet) |
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.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> |
OneSEVPAs.minimize(OneSEVPA<?,I> sevpa,
VPDAlphabet<I> alphabet)
Minimizes the given SEVPA over the given alphabet.
|
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.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 <I> boolean |
OneSEVPAUtil.testEquivalence(OneSEVPA<?,I> sevpa1,
OneSEVPA<?,I> sevpa2,
VPDAlphabet<I> alphabet) |
static <L1,L2,I> OneSEVPA<Pair<L1,L2>,I> |
OneSEVPAs.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.
|
Constructor and Description |
---|
ProductOneSEVPA(VPDAlphabet<I> alphabet,
OneSEVPA<L1,I> sevpa1,
OneSEVPA<L2,I> sevpa2,
AcceptanceCombiner combiner) |
Modifier and Type | Method and Description |
---|---|
static <I> DefaultOneSEVPA<I> |
OneSEVPAMinimizer.minimize(OneSEVPA<?,I> sevpa,
VPDAlphabet<I> alphabet) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractVPDAlphabet<I>
Abstract utility class that implements functionality shared across different subtypes.
|
Modifier and Type | Class and Description |
---|---|
class |
DefaultVPDAlphabet<I>
A list-based, fixed size implementation of a
VPDAlphabet . |
class |
GrowingVPDAlphabet<I>
A
VPDAlphabet implementation that allows to add new symbols after its construction. |
Copyright © 2018. All rights reserved.