ROMJIST Volume 1, No. 1, 1998, pp. 73-83
Gheorghe PAUN String Function Based Machines
ABSTRACT: We propose and briefly investigate a general framework for studying abstract machines (automata) processing strings. One starts from a basic set of partial functions on strings over a given alphabet, and one considers machines which use these string functions according to a specified control mechanism; we deal here with graph control, regular control language, and prescribed finite sequences of functions as control mechanisms. Their relationships are examined and, for a particular set of string functions, inspired from [4], one proves that most variants of the above mentioned types of machines are as powerful as Turing machines. A series of topics for further research are also formulated. Full text not available
