Module net.automatalib.api
Package net.automatalib.automaton
package net.automatalib.automaton
This package (including sub-packages) contains the basic concepts concerning automata.
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 general automaton types mostly describe structural properties whereas semantic interpretations are defined in the
semantic package. However, specific types such as
DFAs or
Mealy machines often provide default implementations for
convenience.
-
InterfacesClassDescriptionAutomaton<S,
I, T> Basic interface for an automaton.Automaton.RegularAutomaton<S,I, T> Convenience interface that describes an automaton with finite syntactic and finite semantic state space.AutomatonCreator<A,I> DeterministicAutomaton<S,I, T> Basic interface for a deterministic automaton.Convenience interface that describes an automaton with finite syntactic and finite semantic state space.FiniteAlphabetAutomaton<S,I, T> MutableAutomaton<S,I, T, SP, TP> A mutable automaton.MutableAutomaton.RegularAutomaton<S,I, T, SP, TP> Convenience interface that describes an automaton with finite syntactic and finite semantic state space.MutableDeterministic<S,I, T, SP, TP> Interface for a mutable deterministic automaton.MutableDeterministic.RegularAutomaton<S,I, T, SP, TP> Convenience interface that describes an automaton with finite syntactic and finite semantic state space.UniversalAutomaton<S,I, T, SP, TP> A universal automaton is a generalized representation of automata, with unified access to the properties of states and transitions.UniversalAutomaton.RegularAutomaton<S,I, T, SP, TP> Convenience interface that describes an automaton with finite syntactic and finite semantic state space.UniversalDeterministicAutomaton<S,I, T, SP, TP> ADeterministicAutomatonwith state and transition properties.UniversalDeterministicAutomaton.RegularAutomaton<S,I, T, SP, TP> Convenience interface that describes an automaton with finite syntactic and finite semantic state space.UniversalFiniteAlphabetAutomaton<S,I, T, SP, TP>