Istituto di Scienza e Tecnologie dell'Informazione     
Caracciolo Di Forino A. Generalized markov algorithms and automata. In: Automata Theory, pp. 107 - 144. Academic Press, 1966.
In this lecture we shall fėrst reall the concept of MNA and compare it with that of turing machines. We shall then introduce the concept of generalized Markov algorithms (GMA), limiting our present exposition to the simplest type, called S-generalized Markov algorithms and we shall apply it to the defėnition of partial-recursive functions. Finally, we shall give some hints of other possible applications, as, for instance, the dcscription of a digital computer.

Icona documento 1) Download Document PDF

Icona documento Open access Icona documento Restricted Icona documento Private


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional