Modifier and Type | Interface and Description |
---|---|
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.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractMutableAutomaton<S,I,T,SP,TP>
Abstract base class for mutable automata.
|
class |
AbstractMutableDeterministic<S,I,T,SP,TP>
Abstract base class for mutable deterministic automata.
|
class |
AbstractShrinkableAutomaton<S,I,T,SP,TP> |
class |
AbstractShrinkableDeterministic<S,I,T,SP,TP> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addInitialState(MutableAutomaton<S,I,T,SP,TP> $this)
Provides a realization of
addInitialState() using
addInitialState(Object) . |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addInitialState(MutableAutomaton<S,I,T,SP,TP> $this,
SP property)
Provides a realization of
addInitialState(Object) using
addState(Object) and setInitial(Object, boolean) . |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addState(MutableAutomaton<S,I,T,SP,TP> $this)
Provides a realization of
addState() using
addState(Object) . |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addTransition(MutableAutomaton<S,I,T,SP,TP> $this,
S state,
I input,
S succ,
TP property)
Provides a realization of
addTransition(Object, Object, Object, Object)
using createTransition(Object, Object) and
addTransition(Object, Object, Object) . |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addTransition(MutableAutomaton<S,I,T,SP,TP> $this,
S state,
I input,
T transition)
Provides a realization of
addTransition(Object, Object, Object)
using TransitionSystem.getTransitions(Object, Object) and
setTransitions(Object, Object, java.util.Collection) . |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.addTransitions(MutableAutomaton<S,I,T,SP,TP> $this,
S state,
I input,
Collection<? extends T> transitions) |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.removeAllTransitions(MutableAutomaton<S,I,T,SP,TP> $this,
S state,
I input)
Provides a realization of
removeAllTransitions(Object, Object)
using setTransitions(Object, Object, java.util.Collection) |
static <S,I,T,SP,TP> |
AbstractMutableAutomaton.removeTransition(MutableAutomaton<S,I,T,SP,TP> $this,
S state,
I input,
T transition)
Provides a realization of
removeTransition(Object, Object, Object)
using TransitionSystem.getTransitions(Object, Object) and
setTransitions(Object, Object, java.util.Collection) |
static <S,I,T,SP,TP> |
AbstractShrinkableAutomaton.unlinkState(MutableAutomaton<S,I,T,SP,TP> automaton,
S state,
S replacement,
Collection<I> inputs) |
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 | 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 | Interface and Description |
---|---|
interface |
MutableDFA<S,I> |
interface |
MutableFSA<S,I> |
interface |
MutableNFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractMutableDFA<S,I> |
class |
AbstractMutableFSA<S,I> |
class |
AbstractMutableNFA<S,I> |
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 | Interface and Description |
---|---|
interface |
MutableMealyMachine<S,I,T,O> |
interface |
MutableMooreMachine<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> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableProbabilisticMealy<S,I,T,O> |
Modifier and Type | Field and Description |
---|---|
protected MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> |
AbstractLowLevelAutomatonCopier.out |
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,I2,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,I2,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. |
<S1,I1,T1,S2,I2,T2,SP2,TP2> |
AutomatonCopyMethod.createLowLevelCopier(Automaton<S1,? super I1,T1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transitionFilter) |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method,
Automaton<S1,? super I1,T1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method,
Automaton<S1,? super I1,T1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies an
Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method,
Automaton<S1,? super I,T1> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and
transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
AutomatonLowLevelCopy.rawCopy(AutomatonCopyMethod method,
Automaton<S1,? super I,T1> in,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and
transition properties. |
Constructor and Description |
---|
AbstractLowLevelAutomatonCopier(TS1 in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractRandomAutomatonGenerator<S,I,T,SP,TP,A extends MutableAutomaton<S,I,T,SP,TP>> |
Modifier and Type | Field and Description |
---|---|
protected A |
AbstractRandomAutomatonGenerator.automaton |
Modifier and Type | Method and Description |
---|---|
static <S1,I1,T1,SP,TP,S2,I2,T2> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in,
int limit,
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> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP,? extends TP> in,
int limit,
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> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in,
int limit,
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> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I1,T1,? extends SP1,? extends TP1> in,
int limit,
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> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in,
int limit,
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> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP,? extends TP> in,
int limit,
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,I2,T2,SP2,TP2> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in,
int limit,
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,I2,T2,SP2,TP2> |
TSCopy.copy(TSTraversalMethod method,
UniversalTransitionSystem<S1,? super I,T1,? extends SP1,? extends TP1> in,
int limit,
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. |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
TSCopy.rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I1,T1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
TSCopy.rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I1,T1> in,
int limit,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputsMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter)
Copies an
TransitionSystem to a MutableAutomaton with possibly heterogeneous input alphabets and
state and transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
TSCopy.rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I,T1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and
transition properties. |
static <S1,I,T1,S2,T2,SP2,TP2> |
TSCopy.rawCopy(TSTraversalMethod method,
TransitionSystem<S1,? super I,T1> in,
int limit,
Collection<? extends I> inputs,
MutableAutomaton<S2,I,T2,SP2,TP2> out,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I,? super T1> transFilter)
Copies an
Automaton to a MutableAutomaton with a compatible input alphabet, but possibly heterogeneous state and
transition properties. |
Constructor and Description |
---|
TSCopyVisitor(TransitionSystem<S1,? super I1,T1> in,
MutableAutomaton<S2,I2,T2,? super SP2,? super TP2> out,
Function<? super I1,? extends I2> inputMapping,
Function<? super S1,? extends SP2> spMapping,
Function<? super T1,? extends TP2> tpMapping,
Predicate<? super S1> stateFilter,
TransitionPredicate<? super S1,? super I1,? super T1> transFilter) |
Copyright © 2015. All rights reserved.