We formally define the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard finite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only finitely many different modification instructions, and the effect of each instruction must be computable
Rubinstein, Roy S.
, Shutt, John N.
(1995). Self-Modifying Finite Automata - Basic Definitions and Results. .
Retrieved from: http://digitalcommons.wpi.edu/computerscience-pubs/192