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> |
static class |
CompactMoore.Creator<I,O> |
Modifier and Type | Method and Description |
---|---|
static <I,A extends MutableFSA<?,I>> |
DOTParsers.fsa(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Boolean> nodeParser,
Function<Map<String,Object>,I> edgeParser)
Parser for
FiniteStateAcceptor s with a custom automaton instance and custom node and edge attributes. |
static <I,A extends MutableFSA<?,I>> |
DOTParsers.fsa(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Boolean> nodeParser,
Function<Map<String,Object>,I> edgeParser,
Collection<String> initialNodeIds)
Parser for
FiniteStateAcceptor s with a custom automaton instance, custom node and edge attributes and
custom labels for the initial nodes. |
static <I,A extends MutableFSA<?,I>> |
DOTParsers.fsa(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Boolean> nodeParser,
Function<Map<String,Object>,I> edgeParser,
Collection<String> initialNodeIds,
boolean fakeInitialNodeIds)
Parser for
FiniteStateAcceptor s with a custom automaton instance, custom node and edge attributes, custom
labels for initial nodes and a flag whether or not the initial nodes are artificial. |
static <I,O,A extends MutableMealyMachine<?,I,?,O>> |
DOTParsers.mealy(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Pair<I,O>> edgeParser)
Parser for
MealyMachine s with a custom automaton instance and custom edge attributes. |
static <I,O,A extends MutableMealyMachine<?,I,?,O>> |
DOTParsers.mealy(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Pair<I,O>> edgeParser,
String initialNodeId)
Parser for
MealyMachine s with a custom automaton instance, custom edge attributes and a custom label for
the initial node. |
static <I,O,A extends MutableMealyMachine<?,I,?,O>> |
DOTParsers.mealy(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,Pair<I,O>> edgeParser,
String initialNodeId,
boolean fakeInitialNodeId)
Parser for
MealyMachine s with a custom automaton instance, custom edge attributes and a custom label for
the initial node and a flag whether or not the initial nodes are artificial. |
static <I,O,A extends MutableMooreMachine<?,I,?,O>> |
DOTParsers.moore(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,O> nodeParser,
Function<Map<String,Object>,I> edgeParser)
Parser for
MooreMachine s with a custom automaton instance and custom node and edge attributes. |
static <I,O,A extends MutableMooreMachine<?,I,?,O>> |
DOTParsers.moore(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,O> nodeParser,
Function<Map<String,Object>,I> edgeParser,
String initialNodeId)
Parser for
MooreMachine s with a custom automaton instance, custom node and edge attributes and a custom
label for the initial node. |
static <I,O,A extends MutableMooreMachine<?,I,?,O>> |
DOTParsers.moore(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,O> nodeParser,
Function<Map<String,Object>,I> edgeParser,
String initialNodeId,
boolean fakeInitialNodeId)
Parser for
MooreMachine s with a custom automaton instance, custom node and edge attributes, a custom
label for the initial node and a flag whether or not the initial node is artificial. |
Constructor and Description |
---|
DOTMutableAutomatonParser(AutomatonCreator<A,I> creator,
Function<Map<String,Object>,SP> nodeParser,
Function<Map<String,Object>,Pair<I,TP>> edgeParser,
Collection<String> initialNodeIds,
boolean fakeInitialNodeIds)
Parser for arbitrary
MutableAutomaton s with a custom automaton instance, custom node and edge attributes
and custom labels for the initial nodes. |
Modifier and Type | Method and Description |
---|---|
static <A extends MutableDFA<?,I>,I> |
HopcroftMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode,
AutomatonCreator<A,I> creator)
Minimizes the given DFA.
|
static <A extends MutableMealyMachine<?,I,?,O>,I,O> |
HopcroftMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet,
HopcroftMinimization.PruningMode pruningMode,
AutomatonCreator<A,I> creator)
Minimizes the given Mealy machine.
|
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 <A extends MutableDFA<?,I>,I> |
PaigeTarjanMinimization.minimizeDFA(DFA<?,I> dfa,
Alphabet<I> alphabet,
AutomatonCreator<A,I> creator)
Minimizes the given DFA.
|
static <A extends MutableMealyMachine<?,I,?,O>,I,O> |
PaigeTarjanMinimization.minimizeMealy(MealyMachine<?,I,?,O> mealy,
Alphabet<I> alphabet,
AutomatonCreator<A,I> creator)
Minimizes the given Mealy machine.
|
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 | 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,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.