Authors

John N. Shutt

Document Type

Other

Publication Date

12-1995

Abstract

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.

DOI

WPI-CS-TR-95-04

Share

 
COinS