Package util

package util

Class	Description
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.
Helper
Physics	Provides utility routes for classic dynamics computation.
Physics.Trig	Container defining useful trigonometric functions Sine and Cosine
SoundEffects
State	Defines the abstract state of a Deterministic Finite State Automaton (DFSA).
TransitionTable	The transition table is implemented by a hash map of hash maps.