Mealy Type State Machines in Tcl
Finite state machines are a powerful abstraction that can be used to structure the sequencing of programs. Here we give an example of usage for Mealy type state machines. This package is a counterpart to the Moore package. We will implement the same example as discussed for the Moore package in terms of Mealy state machines.
Here we describe the mealy package. This is a Tcl extension that facilitates designing state machines into your Tcl programs. The link references a package file that may be installed directly into your teacup.