See: Description
Interface | Description |
---|---|
Automaton<S,I,T> |
Basic interface for an automaton.
|
AutomatonCreator<A,I> | |
DeterministicAutomaton<S,I,T> |
Basic interface for a deterministic automaton.
|
DeterministicAutomaton.FullIntAbstraction<T> |
Interface for
full integer abstractions of a DeterministicAutomaton . |
DeterministicAutomaton.IntAbstraction<T> |
Base interface for
integer abstractions of a DeterministicAutomaton . |
DeterministicAutomaton.StateIntAbstraction<I,T> |
Interface for
state integer abstractions of a DeterministicAutomaton . |
FiniteAlphabetAutomaton<S,I,T> | |
GrowableAlphabetAutomaton<I> |
Interface for declaring, that an automaton supports adding new alphabet symbols after its instantiation.
|
MutableAutomaton<S,I,T,SP,TP> |
A mutable automaton.
|
MutableDeterministic<S,I,T,SP,TP> |
Interface for a mutable deterministic automaton.
|
MutableDeterministic.FullIntAbstraction<T,SP,TP> | |
MutableDeterministic.IntAbstraction<T,SP,TP> | |
MutableDeterministic.StateIntAbstraction<I,T,SP,TP> | |
ShrinkableAutomaton<S,I,T,SP,TP> |
A mutable automaton that also supports destructive modifications, i.e., removal of states and transitions.
|
ShrinkableDeterministic<S,I,T,SP,TP> |
A mutable deterministic automaton that also supports destructive operations, i.e., removal of states and
transitions.
|
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.
|
UniversalDeterministicAutomaton<S,I,T,SP,TP> |
A
DeterministicAutomaton with state and transition properties. |
UniversalDeterministicAutomaton.FullIntAbstraction<T,SP,TP> |
Interface for
full integer abstractions of a UniversalDeterministicAutomaton . |
UniversalDeterministicAutomaton.IntAbstraction<T,SP,TP> |
Base interface for
integer abstractions of a UniversalDeterministicAutomaton . |
UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP> |
Interface for
state integer abstractions of a UniversalDeterministicAutomaton . |
UniversalFiniteAlphabetAutomaton<S,I,T,SP,TP> |
Class | Description |
---|---|
DeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,A extends DeterministicAutomaton.StateIntAbstraction<I,T>> | |
DeterministicAutomaton.StateIntAbstraction.DefaultAbstraction<S,I,T,A extends DeterministicAutomaton<S,I,T>> | |
MutableDeterministic.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends MutableDeterministic.StateIntAbstraction<I,T,SP,TP>> | |
MutableDeterministic.StateIntAbstraction.DefaultAbstraction<S,I,T,SP,TP,A extends MutableDeterministic<S,I,T,SP,TP>> | |
UniversalDeterministicAutomaton.FullIntAbstraction.DefaultAbstraction<I,T,SP,TP,A extends UniversalDeterministicAutomaton.StateIntAbstraction<I,T,SP,TP>> | |
UniversalDeterministicAutomaton.StateIntAbstraction.DefaultAbstraction<S,I,T,SP,TP,A extends UniversalDeterministicAutomaton<S,I,T,SP,TP>> |
An automaton (in the AutomataLib context) is a finite-state transition
system
. Like transition systems, automata are in general nondeterministic, but can be specialized to be deterministic
.
The Automaton
interface has no inherent semantics. Special types of
automata, such as DFAs
or Mealy machines
can be found in the respective subpackages.
net.automatalib.ts
Copyright © 2018. All rights reserved.