| DetOutputAutomaton<S,I,T,D> |
An automaton which deterministically produces an output for an input word.
|
| DetSuffixOutputAutomaton<S,I,T,D> |
|
| FiniteRepresentation |
This interface marks automata types that have a finite representation, i.e. can be represented by a finite number of
entities.
|
| InputAlphabetHolder<I> |
|
| MutableProbabilistic<T> |
|
| MutableStateOutput<S,O> |
|
| MutableTransitionOutput<T,O> |
|
| Output<I,D> |
Feature for automata that compute an output.
|
| OutputAutomaton<S,I,T,D> |
|
| Probabilistic<T> |
|
| StateIDs<S> |
An interface for translating between automaton states and their primitive representations as integers.
|
| StateLocalInput<S,I> |
Concept for transition systems, that can for each state return the set of input symbols for which successor states
are defined.
|
| StateOutput<S,O> |
State output concept.
|
| SuffixOutput<I,D> |
Feature for automata that compute a suffix-observable output function, i.e., they compute an output containing
a part that can be attributed to a suffix of the input.
|
| TransitionOutput<T,O> |
Transition output concept.
|