Modifier and Type | Class and Description |
---|---|
static class |
MealyMachine.MealyGraphView<S,I,T,O,A extends MealyMachine<S,I,T,O>> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableMealyMachine<S,I,T,O> |
Modifier and Type | Class and Description |
---|---|
class |
FastMealy<I,O>
A fast implementation of a Mealy machine.
|
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
Modifier and Type | Method and Description |
---|---|
Word<I> |
IncrementalMealyDAGBuilder.findSeparatingWord(MealyMachine<?,I,?,O> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
Word<I> |
IncrementalMealyTreeBuilder.findSeparatingWord(MealyMachine<?,I,?,O> target,
Collection<? extends I> inputs,
boolean omitUndefined) |
Modifier and Type | Method and Description |
---|---|
InputModelData<String,MealyMachine<?,String,?,String>> |
TAFSerializationMealy.readModel(InputStream is) |
Modifier and Type | Method and Description |
---|---|
void |
TAFSerializationMealy.writeModel(OutputStream os,
MealyMachine<?,String,?,?> model,
Alphabet<String> alphabet) |
Modifier and Type | Method and Description |
---|---|
static <I> void |
TAFWriter.mealyToString(MealyMachine<?,I,?,?> mealy,
Collection<? extends I> inputs) |
static <I> void |
TAFWriter.writeMealy(MealyMachine<?,I,?,?> mealy,
Collection<? extends I> inputs,
Appendable out) |
static <I> void |
TAFWriter.writeMealy(MealyMachine<?,I,?,?> mealy,
Collection<? extends I> inputs,
File out) |
Modifier and Type | Method and Description |
---|---|
static <S,I,O> Pair<ADSNode<S,I,O>,ADSNode<S,I,O>> |
ADSUtil.buildFromTrace(MealyMachine<S,I,?,O> automaton,
Word<I> trace,
S state) |
static <S,I,O> LYResult<S,I,O> |
LeeYannakakis.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input)
Computes an ADS using the algorithm of Lee and Yannakakis.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
ADS.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Compute an adaptive distinguishing sequence for the given automaton and the given set of states.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
StateEquivalence.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes a two-state ADS by using
Automata.findSeparatingWord(UniversalDeterministicAutomaton,
UniversalDeterministicAutomaton, Collection) . |
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.compute(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states)
Computes an ADS by constructing (growing) splitting words for the current set of states and recursively computing
sub-ADSs for the induced partitions.
|
static <S,I,O> Optional<ADSNode<S,I,O>> |
BacktrackingSearch.computeOptimal(MealyMachine<S,I,?,O> automaton,
Alphabet<I> input,
Set<S> states,
BacktrackingSearch.CostAggregator costAggregator)
Computes an ADS by iterating over the successor tree in a breadth-first manner, yielding an optimal (dependant on
the passed optimization function) ADS.
|
Modifier and Type | Method and Description |
---|---|
static <I,O,A extends MealyMachine<?,I,?,O> & InputAlphabetHolder<I>> |
HopcroftMinimization.minimizeMealy(A mealy)
Minimizes the given Mealy machine.
|
static <I,O,A extends MealyMachine<?,I,?,O> & InputAlphabetHolder<I>> |
HopcroftMinimization.minimizeMealy(A mealy,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given Mealy machine.
|
Modifier and Type | Method and Description |
---|---|
static <I,O> CompactMealy<I,O> |
HopcroftMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet)
Minimizes the given Mealy machine.
|
static <I,O> CompactMealy<I,O> |
HopcroftMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given Mealy machine.
|
Modifier and Type | Method and Description |
---|---|
static <I,O> CompactMealy<I,O> |
MealyFilter.filterByOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Predicate<? super O> outputPred) |
static <S1,T1,S2,I,O> |
MealyFilter.filterByOutput(MealyMachine<S1,I,T1,O> in,
Collection<? extends I> inputs,
MutableMealyMachine<S2,I,?,O> out,
Predicate<? super O> outputPred) |
static <I,O> CompactMealy<I,O> |
MealyFilter.pruneTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Collection<? super O> outputs)
Returns a Mealy machine with all transitions removed that have one of the specified output values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.pruneTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
O... outputs)
Returns a Mealy machine with all transitions removed that have one of the specified output values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.retainTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
Collection<? super O> outputs)
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
|
static <I,O> CompactMealy<I,O> |
MealyFilter.retainTransitionsWithOutput(MealyMachine<?,I,?,O> in,
Alphabet<I> inputs,
O... outputs)
Returns a Mealy machine with all transitions removed that have an output not among the specified values.
|
Copyright © 2018. All rights reserved.