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 |
UniversalAutomaton<S,I,T,SP,TP>
A universal automaton is a generalized representation of automata, with a unified
access to the properties 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 |
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 |
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 | Method and Description |
---|---|
<TP> TransitionEdge.Property<I,TP> |
TransitionEdge.property(UniversalTransitionSystem<?,?,T,?,TP> uts) |
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> |
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> |
interface |
ProbabilisticMealyMachine<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 |
IncrementalDFABuilder.TransitionSystemView<S,I,T> |
Modifier and Type | Class and Description |
---|---|
protected static class |
AbstractIncrementalDFABuilder.AbstractTransitionSystemView<S,I,T> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractIncrementalDFADAGBuilder.TransitionSystemView |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalDFATreeBuilder.TransitionSystemView |
class |
IncrementalPCDFATreeBuilder.TransitionSystemView |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalMealyDAGBuilder.AutomatonView |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalMealyTreeBuilder.TransitionSystemView |
Modifier and Type | Interface and Description |
---|---|
interface |
UniversalDTS<S,I,T,SP,TP>
Universal deterministic transition system.
|
Modifier and Type | Interface and Description |
---|---|
interface |
AcceptorTS<S,I>
A transition system whose semantics are defined by whether a state is "accepting"
or not.
|
interface |
DeterministicAcceptorTS<S,I>
A deterministic acceptor transition system.
|
Modifier and Type | Interface and Description |
---|---|
interface |
MealyTransitionSystem<S,I,T,O> |
Modifier and Type | Method and Description |
---|---|
static <S,SP> Function<S,SP> |
TS.stateProperties(UniversalTransitionSystem<S,?,?,SP,?> uts) |
static <T,TP> Function<T,TP> |
TS.transitionProperties(UniversalTransitionSystem<?,?,T,?,TP> uts) |
Modifier and Type | Class and Description |
---|---|
class |
DetAcceptorComposition<S1,S2,I,A1 extends DeterministicAcceptorTS<S1,I>,A2 extends DeterministicAcceptorTS<S2,I>> |
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. |
Copyright © 2015. All rights reserved.