Modifier and Type | Class and Description |
---|---|
static class |
MutableDeterministic.StateIntAbstraction.DefaultAbstraction<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
Modifier and Type | Interface and Description |
---|---|
interface |
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and
transitions.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactDeterministic<I,T,SP,TP>
Abstract super class that refines
AbstractCompact for deterministic automata. |
class |
AbstractCompactSimpleDeterministic<I,SP>
Abstract super class that refines
AbstractCompactDeterministic for transition-property-less automata. |
class |
UniversalCompactSimpleDet<I,SP>
A
AbstractCompactSimpleDeterministic -based implementation for automata that need to store generic state
properties. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractFastMutableDet<S extends AbstractFastState<T>,I,T,SP,TP> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableDFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableMealyMachine<S,I,T,O> |
interface |
MutableMooreMachine<S,I,T,O> |
Modifier and Type | Class and Description |
---|---|
class |
FastMealy<I,O>
A fast implementation of a Mealy machine.
|
class |
FastMoore<I,O>
A fast implementation of a Moore automaton.
|
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
class |
CompactMoore<I,O> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
Automata.invasiveMinimize(A automaton,
Collection<? extends I> inputs) |
static <S,I,T,SP,TP,SO,TO,A extends MutableDeterministic<SO,? super I,TO,? super SP,? super TP>> |
Automata.minimize(UniversalDeterministicAutomaton<S,I,T,SP,TP> automaton,
Collection<? extends I> inputs,
A output) |
Modifier and Type | Method and Description |
---|---|
static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
HopcroftMinimization.minimizeUniversal(UniversalDeterministicAutomaton<?,I,T,SP,TP> automaton,
Alphabet<I> alphabet,
AutomatonCreator<A,I> creator,
AutomatonInitialPartitioning ap,
HopcroftMinimization.PruningMode pruningMode)
Minimizes the given automaton depending on the given partitioning function.
|
Modifier and Type | Method and Description |
---|---|
static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanMinimization.minimizeUniversal(UniversalDeterministicAutomaton<?,I,T,SP,TP> automaton,
Alphabet<I> alphabet,
AutomatonCreator<A,I> creator,
AutomatonInitialPartitioning ap,
Object sinkClassification)
Minimizes the given automaton depending on the given partitioning function.
|
Modifier and Type | Class and Description |
---|---|
class |
RandomDeterministicAutomatonGenerator<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
Modifier and Type | Method and Description |
---|---|
<I,A extends MutableDeterministic<?,I,?,? super SP,? super TP>> |
RandomICAutomatonGenerator.generateICDeterministicAutomaton(int numStates,
Alphabet<I> alphabet,
AutomatonCreator<? extends A,I> creator,
Random r)
Generates an initially-connected (IC) deterministic automaton with the given parameters.
|
<I,A extends MutableDeterministic<?,I,?,? super SP,? super TP>> |
RandomICAutomatonGenerator.generateICDeterministicAutomaton(int numStates,
Collection<? extends I> inputs,
A result,
Random r)
Generates an initially connected (IC) deterministic automaton with the given parameters.
|
<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
RandomAutomata.randomDeterministic(@NonNegative int numStates,
Collection<? extends I> inputs,
Collection<? extends SP> stateProps,
Collection<? extends TP> transProps,
A out) |
<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
RandomAutomata.randomDeterministic(@NonNegative int numStates,
Collection<? extends I> inputs,
Collection<? extends SP> stateProps,
Collection<? extends TP> transProps,
A out,
boolean minimize) |
static <S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
RandomAutomata.randomDeterministic(Random rand,
@NonNegative int numStates,
Collection<? extends I> inputs,
Collection<? extends SP> stateProps,
Collection<? extends TP> transProps,
A out) |
static <S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> |
RandomAutomata.randomDeterministic(Random rand,
@NonNegative int numStates,
Collection<? extends I> inputs,
Collection<? extends SP> stateProps,
Collection<? extends TP> transProps,
A out,
boolean minimize) |
Modifier and Type | Method and Description |
---|---|
static <I,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
SimpleDeterministicAutomaton.FullIntAbstraction absOriginal,
IntFunction<? extends SP> spExtractor,
BiIntFunction<? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Copyright © 2020. All rights reserved.