Modifier and Type | Interface and Description |
---|---|
interface |
Automaton<S,I,T>
Basic interface for an automaton.
|
interface |
DeterministicAutomaton<S,I,T>
Basic interface for a deterministic automaton.
|
interface |
FiniteAlphabetAutomaton<S,I,T> |
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 |
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 |
DetOutputAutomaton<S,I,T,D>
An automaton which deterministically produces an output for an input word.
|
interface |
DetSuffixOutputAutomaton<S,I,T,D> |
interface |
OutputAutomaton<S,I,T,D> |
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 | 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> |
interface |
StateOutputAutomaton<S,I,T,O> |
interface |
TransitionOutputAutomaton<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> |
interface |
ProbabilisticMealyMachine<S,I,T,O> |
Modifier and Type | Interface and Description |
---|---|
interface |
OneSEVPA<L,I>
Interface for the 1-SEVPA (1-single entry visibly push-down automaton), a visibly push-down automaton of specific
structure and semantics.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractOneSEVPA<L,I>
Abstract class for 1-SEVPAs that implements functionality shared across different subtypes.
|
class |
DefaultOneSEVPA<I>
Default implementation for 1-SEVPA.
|
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 |
AbstractIncrementalMealyTreeBuilder.TransitionSystemView |
Modifier and Type | Interface and Description |
---|---|
interface |
Lasso<I,D>
A lasso is an single infinite word.
|
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 |
AbstractLasso<I,D> |
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 | Interface and Description |
---|---|
interface |
DeterministicTransitionSystem<S,I,T>
Deterministic transition system.
|
interface |
PowersetViewTS<S,I,T,OS,OT> |
interface |
UniversalDTS<S,I,T,SP,TP>
Universal deterministic transition system.
|
interface |
UniversalTransitionSystem<S,I,T,SP,TP>
A "universal" transition system, which captures the possibility to assign properties to states and transitions.
|
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 | Class and Description |
---|---|
class |
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
class |
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
Modifier and Type | Class and Description |
---|---|
class |
DTSComposition<S1,S2,I,T1,T2,TS1 extends DeterministicTransitionSystem<S1,I,T1>,TS2 extends DeterministicTransitionSystem<S2,I,T2>> |
class |
TSComposition<S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
Modifier and Type | Field and Description |
---|---|
protected TS1 |
TSComposition.ts1 |
protected TS2 |
TSComposition.ts2 |
Modifier and Type | Method and Description |
---|---|
static <S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
TSCompositions.compose(TS1 ts1,
TS2 ts2) |
static <S1,S2,I,T1,T2,TS1 extends TransitionSystem<S1,I,T1>,TS2 extends TransitionSystem<S2,I,T2>> |
TSCompositions.compose(TS1 ts1,
TS2 ts2) |
Modifier and Type | Interface and Description |
---|---|
interface |
DeterministicOutputTS<S,I,T,O> |
interface |
DeterministicStateOutputTS<S,I,T,O> |
interface |
DeterministicTransitionOutputTS<S,I,T,O> |
interface |
MealyTransitionSystem<S,I,T,O> |
interface |
MooreTransitionSystem<S,I,T,O> |
Modifier and Type | Class and Description |
---|---|
class |
DeterministicPowersetView<S,I,T> |
class |
DirectPowersetDTS<S,I,T> |
class |
FastPowersetDTS<S extends NumericID,I,T> |
Constructor and Description |
---|
DirectPowersetDTS(TransitionSystem<S,I,T> ts) |
FastPowersetDTS(TransitionSystem<S,I,T> ts) |
Modifier and Type | Class and Description |
---|---|
class |
AbstractLowLevelAutomatonCopier<S1,I1,T1,S2,I2,T2,SP2,TP2,TS1 extends TransitionSystem<S1,? super I1,T1>> |
Modifier and Type | Field and Description |
---|---|
protected TS1 |
AbstractLowLevelAutomatonCopier.in |
Modifier and Type | Class and Description |
---|---|
class |
ProductOneSEVPA<L1,L2,I>
Production automaton that allows to join two given 1-SEVPAs.
|
Modifier and Type | Method and Description |
---|---|
static <S,I> Iterable<TS.TransRef<S,I,?>> |
TS.allDefinedInputs(TransitionSystem<S,I,?> ts,
Iterable<? extends S> states,
Iterable<? extends I> inputs) |
static <S,I> Iterator<TS.TransRef<S,I,?>> |
TS.allDefinedInputsIterator(TransitionSystem<S,I,?> ts,
Iterator<? extends S> stateIt,
Iterable<? extends I> inputs) |
static <S,I> Iterable<TS.TransRef<S,I,?>> |
TS.allUndefinedTransitions(TransitionSystem<S,I,?> ts,
Iterable<? extends S> states,
Iterable<? extends I> inputs) |
static <S,I> Iterator<TS.TransRef<S,I,?>> |
TS.allUndefinedTransitionsIterator(TransitionSystem<S,I,?> ts,
Iterator<? extends S> stateIt,
Iterable<? extends I> inputs) |
static <S,I> Iterable<S> |
TS.bfsOrder(TransitionSystem<S,I,?> ts,
Collection<? extends I> inputs) |
static <S,I> Iterator<S> |
TS.bfsOrderIterator(TransitionSystem<S,I,?> ts,
Collection<? extends I> inputs) |
static <S,I> Iterator<I> |
TS.definedInputsIterator(TransitionSystem<S,I,?> ts,
S state,
Iterator<? extends I> inputsIt) |
static <S,I> Iterable<I> |
TS.undefinedInputs(TransitionSystem<S,I,?> ts,
S state,
Iterable<? extends I> inputs) |
static <S,I> Iterator<I> |
TS.undefinedInputsIterator(TransitionSystem<S,I,?> ts,
S state,
Iterator<? extends I> inputsIt) |
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,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) |
Constructor and Description |
---|
AllDefinedInputsIterator(Iterator<? extends S> stateIt,
TransitionSystem<S,I,?> ts,
Iterable<? extends I> inputs) |
AllUndefinedInputsIterator(Iterator<? extends S> stateIt,
TransitionSystem<S,I,?> ts,
Iterable<? extends I> inputs) |
DefinedInputsIterator(TransitionSystem<S,I,?> ts,
S state,
Iterator<? extends I> inputsIt) |
UndefinedInputsIterator(TransitionSystem<S,I,?> ts,
S state,
Iterator<? extends I> inputsIt) |
Modifier and Type | Class and Description |
---|---|
class |
DetMealyComposition<S1,S2,I,T1,T2,O1,O2,A1 extends MealyTransitionSystem<S1,I,T1,O1>,A2 extends MealyTransitionSystem<S2,I,T2,O2>> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,D> boolean |
TSTraversal.breadthFirst(TransitionSystem<S,? super I,T> ts,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis) |
static <S,I,T,D> boolean |
TSTraversal.breadthFirst(TransitionSystem<S,? super I,T> ts,
int limit,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis)
Traverses the given transition system in a breadth-first fashion.
|
static <S,I,T,D> boolean |
TSTraversal.depthFirst(TransitionSystem<S,? super I,T> ts,
int limit,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis) |
static <S,I,T,D> boolean |
TSTraversal.depthFirst(TransitionSystem<S,I,T> ts,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis) |
<S,I,T,D> void |
TSTraversalMethod.traverse(TransitionSystem<S,? super I,T> ts,
int limit,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> visitor) |
static <S,I,T,D> boolean |
TSTraversal.traverse(TraversalOrder order,
TransitionSystem<S,? super I,T> ts,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis) |
static <S,I,T,D> boolean |
TSTraversal.traverse(TraversalOrder order,
TransitionSystem<S,? super I,T> ts,
int limit,
Collection<? extends I> inputs,
TSTraversalVisitor<S,I,T,D> vis) |
Copyright © 2020. All rights reserved.