Modifier and Type | Class and Description |
---|---|
static class |
DeterministicAutomaton.StateIntAbstraction.DefaultAbstraction<S,I,T,A extends DeterministicAutomaton<S,I,T>> |
Modifier and Type | Interface and Description |
---|---|
interface |
MutableDeterministic<S,I,T,SP,TP>
Interface for a mutable deterministic automaton.
|
interface |
ShrinkableDeterministic<S,I,T,SP,TP>
A mutable deterministic automaton that also supports destructive operations, i.e.,
removal 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 |
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> |
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> |
Modifier and Type | Interface and Description |
---|---|
interface |
DFA<S,I>
Deterministic finite state acceptor
|
interface |
MutableDFA<S,I> |
Modifier and Type | Class and Description |
---|---|
class |
FastDFA<I> |
Modifier and Type | Class and Description |
---|---|
class |
CompactDFA<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 |
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.
|
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
Modifier and Type | Method and Description |
---|---|
static <I> void |
Automata.cover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states,
Collection<? super Word<I>> transitions) |
static <I> boolean |
Automata.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStates,
Collection<? extends Word<I>> oldTransitions,
Collection<? super Word<I>> newStates,
Collection<? super Word<I>> newTransitions) |
static <I> boolean |
Automata.incrementalStateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStates,
Collection<? super Word<I>> newStates) |
static <I> boolean |
Automata.incrementalStructuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStructural,
Collection<? super Word<I>> newStructural) |
static <I> List<Word<I>> |
Automata.stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs) |
static <I> List<Word<I>> |
Automata.transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs) |
Modifier and Type | Method and Description |
---|---|
static <S,I,T> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
DeterministicAutomaton<S,I,T> automaton,
Alphabet<I> inputs,
Predicate<? super S> initialClassification,
boolean sinkClassification)
Initializes the partition refinement data structure from a given
deterministic automaton, initializing the initial partition according
to the given classification predicate (i.e., assuming a binary initial
partitioning).
|
static <S1,S2,I,T1,T2,SP,TP,A extends MutableDeterministic<S2,I,T2,SP,TP>> |
PaigeTarjanExtractors.toDeterministic(PaigeTarjan pt,
AutomatonCreator<A,I> creator,
Alphabet<I> inputs,
DeterministicAutomaton<S1,I,T1> original,
StateIDs<S1> origIds,
Function<? super S1,? extends SP> spExtractor,
Function<? super T1,? extends TP> tpExtractor,
boolean pruneUnreachable)
Translates the results of a coarsest stable partition computation into a deterministic automaton.
|
Copyright © 2015. All rights reserved.