Modifier and Type | Class and Description |
---|---|
static class |
CompactDFA.Creator<I> |
static class |
CompactNFA.Creator<I> |
Modifier and Type | Class and Description |
---|---|
static class |
CompactMealy.Creator<I,O> |
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.
|
Modifier and Type | Method and Description |
---|---|
static <I,T,SP,TP,A extends MutableDeterministic<?,I,?,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton.FullIntAbstraction<T> absOriginal,
IntFunction<? extends SP> spExtractor,
Function<? super T,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
static <S1,S2,I,T1,T2,SP,TP,A extends MutableDeterministic<S2,I,T2,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton<S1,I,T1> original,
StateIDs<S1> origIds,
Function<? super S1,? extends SP> spExtractor,
Function<? super T1,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Copyright © 2018. All rights reserved.