Constructor and Description |
---|
StateIDGrowingMapping(Automaton<S,?,?> automaton,
StateIDs<S> stateIds) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactDeterministic<I,T,SP,TP> |
class |
AbstractCompactSimpleDet<I,SP> |
class |
AbstractCompactSimpleNondet<I,SP> |
class |
UniversalCompactSimpleDet<I,SP> |
Modifier and Type | Method and Description |
---|---|
StateIDs<Integer> |
AbstractCompactSimpleNondet.stateIDs() |
StateIDs<Integer> |
AbstractCompactSimpleDet.stateIDs() |
StateIDs<Integer> |
AbstractCompactDeterministic.stateIDs() |
Modifier and Type | Class and Description |
---|---|
class |
FastMutableDet<S extends FastDetState<S,T>,I,T,SP,TP> |
class |
FastMutableNondet<S extends FastNondetState<S,T>,I,T,SP,TP> |
Modifier and Type | Method and Description |
---|---|
StateIDs<S> |
FastMutableNondet.stateIDs() |
StateIDs<S> |
FastMutableDet.stateIDs() |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
class |
FastNFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
class |
CompactNFA<I> |
Constructor and Description |
---|
StateAsNodeIDs(StateIDs<S> stateIds) |
Modifier and Type | Class and Description |
---|---|
class |
SimpleStateIDs<S> |
Constructor and Description |
---|
StateIDStaticMapping(StateIDs<S> stateIds,
int size) |
Modifier and Type | Field and Description |
---|---|
protected StateIDs<S> |
SimpleDeterministicAutomaton.IntAbstraction.DefaultAbstraction.stateIds |
Modifier and Type | Method and Description |
---|---|
default StateIDs<S> |
SimpleAutomaton.stateIDs() |
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.
|
class |
FastProbMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
DeterministicAutomaton<S,I,T> automaton,
Alphabet<I> inputs,
Predicate<? super S> initialClassification,
boolean sinkClassification)
Initializes the partition refinement data structure from a given
deterministic automaton, initializing the initial partition according
to the given classification predicate (i.e., assuming a binary initial
partitioning).
|
static <S,I> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton<S,I> automaton,
Alphabet<I> inputs,
Function<? super S,?> initialClassification,
Object sinkClassification)
Initializes the partition refinement data structure from a given
deterministic automaton, initializing the initial partition according
to the given classification function.
|
Modifier and Type | Method and Description |
---|---|
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 © 2015. All rights reserved.