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.