Modifier and Type | Class and Description |
---|---|
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 | 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 | 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 |
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 |
---|---|
interface |
MutableGraph<N,E,NP,EP>
A graph that allows modification.
|
interface |
UniversalGraph<N,E,NP,EP> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractMutableGraph<N,E,NP,EP> |
Modifier and Type | Class and Description |
---|---|
class |
AbstractCompactGraph<E extends CompactEdge<EP>,NP,EP> |
class |
AbstractCompactNPGraph<E extends CompactEdge<EP>,NP,EP> |
class |
AbstractCompactSimpleGraph<E extends CompactEdge<EP>,EP> |
class |
CompactGraph<NP,EP> |
class |
CompactSimpleBidiGraph<EP> |
class |
CompactSimpleGraph<EP> |
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 | Class and Description |
---|---|
class |
UniversalAutomatonAsGraph<S,I,T,SP,TP,A extends UniversalAutomaton<S,I,T,SP,TP>> |
Modifier and Type | Method and Description |
---|---|
static <E,EP> Mapping<E,EP> |
Graphs.edgeProperties(UniversalIndefiniteGraph<?,E,?,EP> graph) |
static <N,NP> Mapping<N,NP> |
Graphs.nodeProperties(UniversalIndefiniteGraph<N,?,NP,?> graph) |
Modifier and Type | Method and Description |
---|---|
static <N1,E1,N2,E2,NP2,EP2> |
GraphCopy.copyTraversal(UniversalIndefiniteGraph<N1,E1,? extends NP2,? extends EP2> in,
MutableGraph<N2,E2,NP2,EP2> out,
TraversalOrder order,
int limit,
Collection<? extends N1> initialNodes) |
static <N1,E1,NP1,EP1,N2,E2,NP2,EP2> |
GraphCopy.copyUniversalTraversal(UniversalIndefiniteGraph<N1,E1,NP1,EP1> in,
MutableGraph<N2,E2,NP2,EP2> out,
TraversalOrder order,
int limit,
Collection<? extends N1> initialNodes,
Mapping<? super NP1,? extends NP2> npConversion,
Mapping<? super EP1,? extends EP2> epConversion) |
Copyright © 2015. All Rights Reserved.