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. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAutomaton<S,I,T>
Abstract base class for automata.
|
class |
AbstractDeterministicAutomaton<S,I,T>
Abstract base class for deterministic automata.
|
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> Iterator<S> |
AbstractAutomaton.iterator(Automaton<S,I,T> $this)
Provides a realization of
Iterable.iterator() using
Iterable.iterator() . |
static <S,I,T> int |
AbstractAutomaton.size(Automaton<S,I,T> $this)
Provides a realization of
SimpleAutomaton.size() using
SimpleAutomaton.getStates() . |
static <S,I,T> StateIDs<S> |
AbstractAutomaton.stateIDs(Automaton<S,I,T> $this)
Provides a realization of
SimpleAutomaton.stateIDs() using
a SimpleStateIDs object. |
Constructor and Description |
---|
SimpleStateIDs(Automaton<S,?,?> automaton) |
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 |
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,O>
An automaton which deterministically produces an output for an input word.
|
interface |
OutputAutomaton<S,I,T,O> |
interface |
SODetOutputAutomaton<S,I,T,O> |
Modifier and Type | Class and Description |
---|---|
class |
DefaultDOTHelperAutomaton<S,I,T,A extends Automaton<S,I,T>> |
Modifier and Type | Interface and Description |
---|---|
interface |
DOTPlottableAutomaton<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 |
AbstractDFA<S,I> |
class |
AbstractFSA<S,I> |
class |
AbstractMutableDFA<S,I> |
class |
AbstractMutableFSA<S,I> |
class |
AbstractMutableNFA<S,I> |
class |
AbstractNFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
class |
FastNFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractAutomatonGraph<S,I,T,SP,TP> |
Modifier and Type | Method and Description |
---|---|
static <S,I,T,V> MutableMapping<S,V> |
AbstractAutomatonGraph.createDynamicNodeMapping(Automaton<S,I,T> $this) |
static <S,I,T> Collection<TransitionEdge<I,T>> |
AbstractAutomatonGraph.createOutgoingEdges(Automaton<S,I,T> automaton,
Collection<? extends I> inputs,
S state) |
static <S,I,T,V> MutableMapping<S,V> |
AbstractAutomatonGraph.createStaticNodeMapping(Automaton<S,I,T> $this) |
static <S,I,T> Collection<S> |
AbstractAutomatonGraph.getNodes(Automaton<S,I,T> $this) |
static <S,I,T> S |
AbstractAutomatonGraph.getTarget(Automaton<S,I,T> $this,
TransitionEdge<I,T> edge) |
static <S,I,T> NodeIDs<S> |
AbstractAutomatonGraph.nodeIDs(Automaton<S,I,T> $this) |
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 |
MutableProbabilisticMealy<S,I,T,O> |
interface |
ProbabilisticMealyMachine<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 | 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 | Class and Description |
---|---|
class |
AbstractIncrementalDFABuilder<I> |
class |
IncrementalDFABuilder<I>
Incrementally builds an (acyclic) DFA, from a set of positive and negative words.
|
class |
IncrementalPCDFABuilder<I> |
Modifier and Type | Class and Description |
---|---|
class |
IncrementalMealyBuilder<I,O>
Incrementally builds an (acyclic) Mealy machine, from a set of input and corresponding
output words.
|
Modifier and Type | Method and Description |
---|---|
static <S,I,T> Graph<S,TransitionEdge<I,T>> |
Automata.asGraph(Automaton<S,I,T> automaton,
Collection<? 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 |
---|---|
static <S1,I1 extends I2,T1,S2,I2,SP2,TP2> |
AutomatonCopy.copyPlain(Automaton<S1,I1,T1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,?,SP2,TP2> out,
Mapping<? super S1,? extends SP2> spMapping,
Mapping<? super T1,? extends TP2> tpMapping) |
static <S1,I1,T1,S2,I2,T2,SP2,TP2> |
AutomatonCopy.copyPlain(Automaton<S1,I1,T1> in,
Collection<? extends I1> inputs,
MutableAutomaton<S2,I2,T2,SP2,TP2> out,
Mapping<? super I1,? extends I2> inputsMapping,
Mapping<? super S1,? extends SP2> spMapping,
Mapping<? super T1,? extends TP2> tpMapping) |
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. |
Copyright © 2015. All Rights Reserved.