Back to Search
Start Over
On the Optimal Number of Instructions for Universal Turing Machines Connected with a Finite Automaton.
- Source :
-
International Journal of Algebra & Computation . Apr2003, Vol. 13 Issue 2, p133. 70p. - Publication Year :
- 2003
-
Abstract
- In this paper, a new computation system is defined by coupling a finite automaton with a deterministic Turing machine with one head and one tape that is infinite in one direction only. In a first part of the paper, it is shown that there is a Turing machine with five instructions for which it is possible to devise a finite automaton such that the resulting computation is able to simulate any Turing machine. In a second part of the paper it is shown that if the Turing machine has at most four instructions, whatever the finite automaton is, the halting of the resulting computation is always decidable. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 02181967
- Volume :
- 13
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- International Journal of Algebra & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 9585324
- Full Text :
- https://doi.org/10.1142/S0218196703001262