The Self-Modifying Finite Automaton (SMFA) is a model of computation introduced in [RS93, RS94, RS95b]. Formal definitions appear in [RS95a]. This paper further investigates the computational power of the model, and introduces the concepts of path determinism and register complexity.
Shutt, John N.
(1995). Self-Modifying Finite Automata - Power and Limitations. .
Retrieved from: http://digitalcommons.wpi.edu/computerscience-pubs/190