We present here a new model of computation: the Self-Modifying Finite Au- tomaton (SMFA). This is similar to a standard finite automaton, but changes to the machine are allowed during a computation. It is shown here that a weak form of this model has the power to recognize an important class of context-free languages, the metalinear languages, as well as some significant non-context-free languages. Less restricted forms of SMFA's may accept even more.
Rubinstein, Roy S.
, Shutt, John N.
(1993). Self-Modifying Finite Automata. .
Retrieved from: http://digitalcommons.wpi.edu/computerscience-pubs/180