F-Index

F

FSM - Class in util: 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 q₀ ∈ 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.
FSM(State[], String[], State[][]) - Constructor for class util.FSM: Constructor for the FSM takes an array of states, actions, and the transition table.