On the optimal number of instructions for universal turing machines connected with a finite automaton

International Journal of Algebra and Computation

Volumn 13, Issue 2, 2003, Pages 133-202

  Margenstern, Maurice ^a   Pavlotskaïa, Lioudmila ^b  

^a UNIVERSITÉ DE LORRAINE   (France)

^b NONE

Author keywords

Decidability; Finite automata; Turing machines; Universality

Indexed keywords

EID: 0037768363     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218196703001262     Document Type: Article

References (19)

1. G. Baiocchi, 3N+1, UTM e Tag-systems, private communication (June 1998) (in Italian).
2. G. T. Hermann, The uniform halting problem for generalised one state Turing machines, Proc. Ninth Ann. Switching Automata Theory Symp. (1968).
3. M. Margenstern, Machine de Turing universelle sur {0, 1} à trois instructions gauches, LITP/IBP Res. Rep., No93-36 (1993), 38pp.
4. M. Margenstern, Turing machines: On the frontier between a decidable halting problem and universality. Lecture Notes in Computer Science 710 (1993), 375-385, in Proc. FCT'93.
5. M. Margenstern, Non-erasing Turing machines: A new frontier between a decidable halting problem and universality, Lecture Notes in Computer Science 911 (1995), 386-397, Proc. LATIN'95.
6. M. Margenstern, Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey, Lecture Notes in Computer Science 1234 (1997), 226-236, Proc. LFCS'97.
7. M. Margenstern, The laterally problem for non-erasing Turing machines on {0 1} is completely solved, Theoret. Inf. Appl. 31 (2), (1997), 159-204.
8. M. Margenstern, Frontier between decidability and undecidability: A survey, Proc. MCU'98, I, ISBN 2-9511539-2-9, The University of Metz (1998), 141-177.
9. M. Margenstern, Frontier between decidability and undecidability a survey, Theoret. Comput. Sci. 231-2 (2000), 217-251.
10. M. Margenstern and L. Pavlotskaïa, Vers une nouvelle approche de l'universalité concernant les machines de Turing, LITP/IBP Res. Rep., No95.58, (1995).
11. M. Margenstern and L. Pavlotskaya, Deux machines de Turing universelles à au plus deux instructions gauches. C.R.A.S., Paris, 320 (I) (1995), 1395-1400.
12. M. Margenstern and L. Pavlotskaya, A new kind of very small universal Turing machines, CAW'96, SchlossRauischholzhausen, Germany, March 25-27 (1996).
13. M. Margenstern and L. Pavlotskaya, A new decidability result on Turing machines, JAF'15, Invited Lecture, (1997), Mons, Belgium, December 11-12.
14. M. L. Minsky, Computation: Finite and Infinite Machines, Prentice Hall, Englewood Cliffs, NJ, (1967).
15. L. M. Pavlotskaya, Razreshimost' problemy ostanovki dlja nekotorykh klaasov mashin T'juringa, Matematicheskie Zametki 13 (6) (1973), 899-909 (Transl. Solvability of the halting problem for certain classes of Turing machines, Notes Acad. Sci. USSR 13 (6) (1973), 537-541).
16. L. M. Pavlotskaya, Razreshimost' problemy ostanovki dlja nekotorykh klaasov mashin T'juringa, Matematicheskie Zametki 13 (6) (1973), 899-909 (Transl. Solvability of the halting problem for certain classes of Turing machines, Notes Acad. Sci. USSR 13 (6) (1973), 537-541).
17. L. M. Pavlotskaya, O minimal'nom chisle razlichnykh kodov vershin v grafe universal'noj mashiny T'juringa, Diskretnyj analiz, Sbornik trudov instituta matematiki SO AN SSSR 27 (1975), 52-60 (On the minimal number of distinct codes for the vertices of the graph of a universal Turing machine) (in Russian).
18. L. M. Pavlotskaya, Sur les systèmes de calcul, Proc. MCU'95, LITP/IBP Res. Rep. No 96/31 (1996), 168-177.
19. L. M. Pavlotskaya, On machines, universal by extensions, Theoret. Comput. Sci. 168-2 (1996), 257-266, special issue on Universal Machines and Computations (MCU'95).