Modifier and Type | Interface and Description |
---|---|
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> |
Constructor and Description |
---|
StateIDDynamicMapping(Automaton<S,?,?> automaton) |
StateIDGrowingMapping(Automaton<S,?,?> automaton,
StateIDs<S> stateIds) |
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 |
DetOutputAutomaton<S,I,T,D>
An automaton which deterministically produces an output for an input word.
|
interface |
OutputAutomaton<S,I,T,D> |
interface |
SODetOutputAutomaton<S,I,T,D> |
Modifier and Type | Class and Description |
---|---|
class |
DefaultDOTHelperAutomaton<S,I,T,A extends Automaton<S,I,T>> |
Modifier and Type | Field and Description |
---|---|
protected A |
DefaultDOTHelperAutomaton.automaton |
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 |
AbstractAutomatonGraphView<S,A extends Automaton<S,?,?>,E> |
class |
AutomatonGraphView<S,I,T,A extends Automaton<S,I,T>> |
Modifier and Type | Field and Description |
---|---|
protected A |
AbstractAutomatonGraphView.automaton |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,A extends Automaton<S,I,T> & InputAlphabetHolder<I>> |
AutomatonGraphView.create(A automaton) |
static <S,I,T,A extends Automaton<S,I,T>> |
AutomatonGraphView.create(A automaton,
Collection<? extends I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Collection<TransitionEdge<I,T>> |
AutomatonGraphView.createTransitionEdges(Automaton<S,I,T> automaton,
Collection<? extends I> inputs,
S state) |
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 |
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> |
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 | Method and Description |
---|---|
static <I> void |
TAFWriter.writeAny(Automaton<?,I,?> automaton,
Collection<? extends I> inputs,
Appendable out) |
Modifier and Type | Method and Description |
---|---|
static <S,I> Iterable<TS.TransRef<S,I,?>> |
Automata.allDefinedInputs(Automaton<S,I,?> automaton,
Iterable<? extends I> inputs) |
static <S,I> Iterator<TS.TransRef<S,I,?>> |
Automata.allDefinedInputsIterator(Automaton<S,I,?> automaton,
Iterable<? extends I> inputs) |
static <S,I> Iterable<TS.TransRef<S,I,?>> |
Automata.allUndefinedInputs(Automaton<S,I,?> automaton,
Iterable<? extends I> inputs) |
static <S,I> Iterator<TS.TransRef<S,I,?>> |
Automata.allUndefinedInputsIterator(Automaton<S,I,?> automaton,
Iterable<? extends I> inputs) |
static <S,I,T> Graph<S,TransitionEdge<I,T>> |
Automata.asGraph(Automaton<S,I,T> automaton,
Collection<? extends I> inputs) |
static <S,I> TS.TransRef<S,I,?> |
Automata.findUndefinedInput(Automaton<S,I,?> automaton,
Iterable<? extends I> inputs) |
static <I> boolean |
Automata.hasUndefinedInput(Automaton<?,I,?> automaton,
Iterable<? extends I> inputs) |
Modifier and Type | Class and Description |
---|---|
class |
AutomatonAsGraph<S,I,T,A extends Automaton<S,I,T>> |
Modifier and Type | Field and Description |
---|---|
protected A |
AutomatonAsGraph.automaton |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Collection<TransitionEdge<I,T>> |
AGHelper.outgoingEdges(Automaton<S,I,T> aut,
S state,
Collection<? extends I> inputAlphabet) |
Modifier and Type | Method and Description |
---|---|
<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. |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> void |
GraphDOT.write(Automaton<S,I,T> automaton,
Collection<? extends I> inputAlphabet,
Appendable a,
GraphDOTHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)
Renders an
Automaton in the GraphVIZ DOT format. |
static <S,I,T> void |
GraphDOT.write(Automaton<S,I,T> automaton,
GraphDOTHelper<S,? super TransitionEdge<I,T>> helper,
Collection<? extends I> inputAlphabet,
Appendable a,
GraphDOTHelper<S,? super TransitionEdge<I,T>>... additionalHelpers)
Renders an
Automaton in the GraphVIZ DOT format. |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> void |
Visualization.visualizeAutomaton(Automaton<S,I,T> automaton,
Collection<? extends I> inputs,
boolean modal,
GraphDOTHelper<S,TransitionEdge<I,T>>... addlHelpers) |
Copyright © 2015. All rights reserved.