Modifier and Type | Interface and Description |
---|---|
interface |
DeterministicAutomaton<S,I,T>
Basic interface for a deterministic automaton.
|
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 | Class and Description |
---|---|
static class |
SimpleDeterministicAutomaton.IntAbstraction.DefaultAbstraction<S,A extends SimpleDeterministicAutomaton<S,?>>
Base class implementing the default way of obtaining an integer abstraction from an automaton, i.e., by
mapping states to integers and vice versa using the
StateIDs mapping obtained via SimpleAutomaton.stateIDs() . |
static class |
SimpleDeterministicAutomaton.StateIntAbstraction.DefaultAbstraction<S,I,A extends SimpleDeterministicAutomaton<S,I>>
Base class implementing the default way of obtaining a
SimpleDeterministicAutomaton.StateIntAbstraction . |
Modifier and Type | Field and Description |
---|---|
protected A |
SimpleDeterministicAutomaton.IntAbstraction.DefaultAbstraction.automaton |
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 <S,I> StateIDs<S> |
PaigeTarjanInitializers.initDeterministic(PaigeTarjan pt,
SimpleDeterministicAutomaton<S,I> automaton,
Alphabet<I> inputs,
Function<? super S,?> initialClassification,
Object sinkClassification)
Initializes the partition refinement data structure from a given deterministic automaton, initializing the
initial partition according to the given classification function.
|
Copyright © 2019. All rights reserved.