论文信息 - Self-Modifying Finite Automata - Power and Limitations

Self-Modifying Finite Automata - Power and Limitations

The Self-Modifying Finite Automaton (SMFA) is a model of computation introduced in [RS93, RS94, RS95b]. Formal de nitions appear in [RS95a]. This paper further investigates the computational power of the model, and introduces the concepts of path determinism and register complexity.

John N. Shutt

[1] John N. Shutt,et al. Self-Modifying Finite Automata: An Introduction , 1995, Inf. Process. Lett..

[2] Michael A. Harrison,et al. Introduction to formal language theory , 1978 .

[3] John N. Shutt,et al. Self-Modifying Finite Automata - Basic Definitions and Results , 1995 .

[4] S. Ginsburg,et al. Finite-Turn Pushdown Automata , 1966 .