Package | Description |
---|---|
net.automatalib.automata |
This package contains the basic interfaces for automata.
|
net.automatalib.automata.base.compact | |
net.automatalib.automata.fsa.impl.compact | |
net.automatalib.automata.transout.impl.compact | |
net.automatalib.util.partitionrefinement |
Modifier and Type | Interface and Description |
---|---|
static interface |
MutableDeterministic.FullIntAbstraction<T,SP,TP> |
static interface |
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP>
Interface for
full integer abstractions of a
UniversalDeterministicAutomaton . |
Modifier and Type | Class and Description |
---|---|
static class |
DeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>> |
static class |
MutableDeterministic.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends MutableDeterministic.StateIntAbstraction<I,T,SP,TP>> |
static class |
UniversalDeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>> |
Modifier and Type | Method and Description |
---|---|
default DeterministicAutomaton.FullIntAbstraction<T> |
DeterministicAutomaton.fullIntAbstraction(Alphabet<I> alphabet) |
default DeterministicAutomaton.FullIntAbstraction<T> |
DeterministicAutomaton.fullIntAbstraction(int numInputs,
IntFunction<? extends I> symMapping) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactDeterministic<I,T,SP,TP> |
class |
AbstractCompactSimpleDet<I,SP> |
class |
UniversalCompactSimpleDet<I,SP> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
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.
|
Copyright © 2015. All rights reserved.