Package net.automatalib.automaton
This package (including sub-packages) contains the basic classes 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 Automaton
interface has no inherent semantics. Special types of
automata, such as DFAs
or
Mealy machines
can be found in the respective subpackages.
- See Also:
net.automatalib.ts
-
Class Summary Class Description CompactTransition<TP> UniversalCompactDet<I,SP,TP> A default implementation forAbstractCompactDeterministic
that usesCompactTransition
as transition type and supports various types of state and transition properties.UniversalCompactSimpleDet<I,SP> AAbstractCompactSimpleDeterministic
-based implementation for automata that need to store generic state properties.