{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T13:14:21Z","timestamp":1675257261607},"reference-count":14,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2001,4,1]],"date-time":"2001-04-01T00:00:00Z","timestamp":986083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4490,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2001,4]]},"DOI":"10.1016\/s0304-3975(00)00114-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:59:17Z","timestamp":1027594757000},"page":"153-166","source":"Crossref","is-referenced-by-count":5,"title":["On quasi-unilateral universal Turing machines"],"prefix":"10.1016","volume":"257","author":[{"given":"Maurice","family":"Margenstern","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00114-6_BIB1","unstructured":"M. Margenstern, D\u00e9cidabilit\u00e9 du probl\u00e8me de l'arr\u00eat pour les machines de Turing non-effa\u00e7antes sur {0,1} et \u00e0 deux instructions gauches, LITP Research Report No. 94.03, Institut Blaise Pascal, 1994."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB2","unstructured":"M. Margenstern, Machine de Turing universelle sur {0,1} \u00e0 trois instructions gauches, LITP Research Report No. 93.36, Institut Blaise Pascal, 1993."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB3","unstructured":"M. Margenstern, Une machine de Turing universelle sur {0,1}, non-effacant\u0229 et \u00e0 trois instructions gauches, LITP Research Report No. 94.08, Institut Blaise Pascal, 1994."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB4","first-page":"101","article-title":"Une machine de Turing universelle non-effacant\u0229 \u00e0 exactement trois instructions gauches","volume":"320-I","author":"Margenstern","year":"1995","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(00)00114-6_BIB5","doi-asserted-by":"crossref","unstructured":"M. Margenstern, Non-erasing Turing machines: a new frontier between a decidable halting problem and universality, Lecture Notes in Computer Science, Vol. 911, Proc. LATIN\u201995, 1995, pp. 386\u2013397.","DOI":"10.1007\/3-540-59175-3_104"},{"key":"10.1016\/S0304-3975(00)00114-6_BIB6","unstructured":"M. Margenstern, L. Pavlotskaya, Deux machines de Turing universelles: l'une sur {0,1} avec deux instructions gauches, l'autre sur {0,1,2} avec une seule instruction gauche, LITP Research Report No. 95\/25, Institut Blaise Pascal, 1995."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB7","first-page":"1395","article-title":"Deux machines de Turing universelles \u00e0 au plus deux instructions gauches","volume":"320-I","author":"Margenstern","year":"1995","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/S0304-3975(00)00114-6_BIB8","series-title":"Computation: Finite and Infinite Machines","author":"Minsky","year":"1967"},{"key":"10.1016\/S0304-3975(00)00114-6_BIB9","doi-asserted-by":"crossref","unstructured":"L.M. Pavlotskaya, Razreshi- most\u2019 problemy ostanovki dlja nekotorykh klassov mashin Tjuringa. Mat. Zametki 13(6) Ijun\u2019 (1973) 899\u2013909. (transl. Solvability of the halting problem for certain classes of Turing machines, Notes of the Acad. Sci. USSR 13(6) (1973) 537\u2013541).","DOI":"10.1007\/BF01163965"},{"key":"10.1016\/S0304-3975(00)00114-6_BIB10","unstructured":"Ju.V. Rogozhin, Sem\u2019 universal'nykh mashin Tjuringa. Matematicheskie Issledovanija 69 (1982) 76\u201390. (Seven universal Turing machines) (in Russian)."},{"issue":"2","key":"10.1016\/S0304-3975(00)00114-6_BIB11","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/S0304-3975(96)00077-1","article-title":"On small universal Turing machines","volume":"168","author":"Rogozhin","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB12","unstructured":"Ju.V. Rogozhin, A universal Turing machine with 22 states and 2 symbols, Romanian J. Inform. Sci. Tech. (1998)."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB13","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01343730","article-title":"Tag systems and lag systems","volume":"152","author":"Wang","year":"1963","journal-title":"Math. Ann."},{"key":"10.1016\/S0304-3975(00)00114-6_BIB14","doi-asserted-by":"crossref","unstructured":"M.L. Minsky, Size and structure of universal Turing machines using a tag system, in: Recursive function theory, Symposia in pure mathematics, V5, American Mathematical Society, 1962.","DOI":"10.1090\/pspum\/005\/0142452"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001146?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500001146?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:48:29Z","timestamp":1578458909000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500001146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,4]]},"references-count":14,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,4]]}},"alternative-id":["S0304397500001146"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00114-6","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2001,4]]}}}