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>
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 |
UniversalCompactSimpleDet<I,SP>
A
AbstractCompactSimpleDeterministic -based implementation for automata that need to store generic state
properties. |
Modifier and Type | Class and Description |
---|---|
class |
AbstractFastMutableDet<S extends AbstractFastState<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 |
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.
|
Modifier and Type | Class and Description |
---|---|
class |
CompactMealy<I,O> |
class |
CompactMoore<I,O> |
Modifier and Type | Class and Description |
---|---|
class |
BricsDFA
Adapter class for wrapping a Brics automaton as a
DFA . |
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 | Method and Description |
---|---|
static <I> List<Word<I>> |
Automata.stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a state cover.
|
static <I> List<Word<I>> |
Automata.structuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a structural cover.
|
static <I> List<Word<I>> |
Automata.transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Convenient method for computing a state cover.
|
Modifier and Type | Method and Description |
---|---|
static <I> void |
Covers.cover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states,
Collection<? super Word<I>> transitions)
Utility method that allows to compute a state and transition cover simultaneously.
|
static <I> boolean |
Covers.incrementalCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStateCover,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newStateCover,
Collection<? super Word<I>> newTransCover)
Utility method that allows to compute an incremental state and transition cover simultaneously.
|
static <S,I> boolean |
Covers.incrementalStateCover(DeterministicAutomaton<S,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldStates,
Collection<? super Word<I>> newStates)
Computes an incremental state cover for a given automaton, i.e. a cover that only contains the missing sequences
for obtaining a complete state cover.
|
static <I> Iterator<Word<I>> |
Covers.incrementalStateCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> stateCover)
Returns an iterator for the remaining sequences of a state cover.
|
static <I> boolean |
Covers.incrementalStructuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldCover,
Collection<? super Word<I>> newCover)
Computes an incremental structural cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete structural cover.
|
static <I> boolean |
Covers.incrementalTransitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> oldTransCover,
Collection<? super Word<I>> newTransCover)
Computes an incremental transition cover for a given automaton, i.e. a cover that only contains the missing
sequences for obtaining a complete transition cover.
|
static <I> Iterator<Word<I>> |
Covers.incrementalTransitionCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? extends Word<I>> transitionCover)
Returns an iterator for the remaining sequences of a transition cover.
|
static <I> void |
Covers.stateCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> states)
Computes a state cover for a given automaton.
|
static <I> Iterator<Word<I>> |
Covers.stateCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Returns an iterator for the sequences of a state cover.
|
static <I> void |
Covers.structuralCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> cover)
Computes a structural cover for a given automaton.
|
static <I> void |
Covers.transitionCover(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs,
Collection<? super Word<I>> transitions)
Computes a transition cover for a given automaton.
|
static <I> Iterator<Word<I>> |
Covers.transitionCoverIterator(DeterministicAutomaton<?,I,?> automaton,
Collection<? extends I> inputs)
Returns an iterator for the sequences of a transition cover.
|
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 © 2019. All rights reserved.