Uses of Interface
common.Configuration

Uses of Configuration in common

Classes in common that implement Configuration

Modifier and Type	Class	Description
class	FSM	Deterministic Finite State Automaton (DFSA) The FSM class defines a DFSA in terms of a 5-tuple, (Q, Σ, δ, q0, F) a finite set of states Q finite set of input symbols called the alphabet Σ transition function δ : Q × Σ → Q one initial or start state q0 ∈ Q a set of accept states F ⊆ Q The set of states, the set of actions, and the two-dimensional transition table defines the FSM.
class	TransitionTable	The transition table is implemented by a hash map of hash maps.