Pure Data objects for managing flow through Finite State Machines
-
Updated
Feb 2, 2014 - C
A finite-state machine (FSM), finite-state automaton (FSA), or simply state machine is a mathematical model of computation and an abstract machine that can be in exactly one of a finite number of states at any given time.
The FSM can change from one state to another in response to some inputs; the change from one state to another is called a transition.
An FSM is defined by a list of its states, its initial state, and the inputs that trigger each transition.
In computer science, FSM are widely used in modeling of application behavior (control theory), design of hardware digital systems, software engineering, compilers, network protocols, and computational linguistics.
Pure Data objects for managing flow through Finite State Machines
A media-type validator given a media-range, using a fsm
An oscilloscope capturing data from Ethernet and graphing it alongside with Fourier Transform
Battleship alike two-player terminal game
Application skeleton for services written in C
A feature-rich, yet simple finite state machine (FSM) implementation in C
Touch dimmer with 2 touch sensor and 2 LED on Arduino (A small demo for using and documenting of state machine)
yacup: Yet Another C Utilities Package
fsmconv is a command-line tool for converting FSA from one to another representation.