Modifier and Type | Interface and Description |
---|---|
interface |
MutableAutomaton<S,I,T,SP,TP>
A mutable automaton.
|
interface |
MutableDeterministic<S,I,T,SP,TP>
Interface for a mutable deterministic automaton.
|
interface |
ShrinkableAutomaton<S,I,T,SP,TP>
A mutable automaton that also supports destructive modifications, i.e., removal of states and transitions.
|
interface |
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and
transitions.
|
interface |
UniversalDeterministicAutomaton<S,I,T,SP,TP>
A
DeterministicAutomaton with state and transition properties. |
interface |
UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompact<I,T,SP,TP>
Abstract super class for compact automata representations.
|
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 |
AbstractCompactSimpleNondet<I,SP>
Abstract super class that refines
AbstractCompact 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 |
AbstractFastMutable<S extends AbstractFastState<?>,I,T,SP,TP>
Shared functionality for (non-) deterministic mutable automata.
|
class |
AbstractFastMutableDet<S extends AbstractFastState<T>,I,T,SP,TP> |
class |
AbstractFastMutableNondet<S extends AbstractFastState<Collection<T>>,I,T,SP,TP> |
Modifier and Type | Interface and Description |
---|---|
interface |
DFA<S,I>
Deterministic finite state acceptor.
|
interface |
FiniteStateAcceptor<S,I>
FiniteStateAcceptor s accept regular languages. |
interface |
MutableDFA<S,I> |
interface |
MutableFSA<S,I> |
interface |
MutableNFA<S,I> |
interface |
NFA<S,I>
Nondeterministic finite state acceptor.
|
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
class |
FastNFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
class |
CompactNFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
UniversalAutomatonGraphView<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP> & InputAlphabetHolder<I>> |
UniversalAutomatonGraphView.create(A automaton) |
static <S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>> |
UniversalAutomatonGraphView.create(A automaton,
Collection<? extends I> inputs) |
Modifier and Type | Interface and Description |
---|---|
interface |
MealyMachine<S,I,T,O> |
interface |
MooreMachine<S,I,T,O> |
interface |
MutableMealyMachine<S,I,T,O> |
interface |
MutableMooreMachine<S,I,T,O> |
interface |
StateLocalInputMealyMachine<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.
|
class |
FastProbMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
class |
CompactMoore<I,O> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableProbabilisticMealy<S,I,T,O> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractBricsAutomaton
Base class for Brics automata adapters.
|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
class |
BricsNFA
Adapter class for wrapping a Brics automaton as an
NFA . |
Modifier and Type | Interface and Description |
---|---|
static interface |
Lasso.DFALasso<I>
A DFALasso is a lasso for
DFA s. |
static interface |
Lasso.MealyLasso<I,O>
A MealyLasso is a lasso for
MealyMachine s. |
Modifier and Type | Class and Description |
---|---|
class |
DFALassoImpl<I>
A DFALasso is a lasso for
DFA s. |
class |
MealyLassoImpl<I,O>
A MealyLasso is a lasso for
MealyMachine s. |
Modifier and Type | Method and Description |
---|---|
<I,SP,TP> void |
SAFOutput.writeAutomaton(UniversalAutomaton<?,I,?,SP,TP> source,
Alphabet<I> alphabet,
net.automatalib.serialization.saf.AutomatonType expectedType,
BlockPropertyEncoder<? super SP> spEncoder,
SinglePropertyEncoder<? super TP> tpEncoder) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,SP,TP> |
Automata.asUniversalGraph(UniversalAutomaton<S,I,T,SP,TP> automaton,
Collection<? extends I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <S1,I1,T1,SP,TP,S2,I2,T2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I1,T1,? extends SP,? extends TP> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP,? super TP> out,
Function<? super I1,? extends I2> inputsMapping)
Copies a
UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties. |
static <S1,I1,T1,SP,TP,S2,I2,T2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I1,T1,? extends SP,? extends TP> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP,? super TP> out,
Function<? super I1,? extends I2> inputsMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies a
UniversalAutomaton with possibly heterogeneous input alphabets, but compatible properties. |
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I1,T1,? extends SP1,? extends TP1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform)
Copies a
UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I1,T1,SP1,TP1,S2,I2,T2,SP2,TP2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I1,T1,? extends SP1,? extends TP1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies a
UniversalAutomaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I,T1,SP,TP,S2,T2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I,T1,? extends SP,? extends TP> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP,? super TP> out)
Copies a
UniversalAutomaton with compatible input alphabets and properties. |
static <S1,I,T1,SP,TP,S2,T2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I,T1,? extends SP,? extends TP> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP,? super TP> out,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies a
UniversalAutomaton with compatible input alphabets and properties. |
static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I,T1,? extends SP1,? extends TP1> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform)
Copies a
UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly
heterogeneous properties. |
static <S1,I,T1,SP1,TP1,S2,T2,SP2,TP2> |
AutomatonLowLevelCopy.copy(AutomatonCopyMethod method,
UniversalAutomaton<S1,? super I,T1,? extends SP1,? extends TP1> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,? super SP2,? super TP2> out,
Function<? super SP1,? extends SP2> spTransform,
Function<? super TP1,? extends TP2> tpTransform,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies a
UniversalAutomaton to a MutableAutomaton with compatible input alphabets, but possibly
heterogeneous properties. |
Copyright © 2019. All rights reserved.