Self-Modifying Finite Automata-Basic Definitions and Results

@inproceedings{Rubinstein2013SelfModifyingFA,
  title={Self-Modifying Finite Automata-Basic Definitions and Results},
  author={Roy S. Rubinstein},
  year={2013}
}
We formally de ne 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 nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only… CONTINUE READING