{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:52:09Z","timestamp":1759938729602},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539827"},{"type":"electronic","value":"9783540465638"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-53982-4_5","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:20:49Z","timestamp":1330208449000},"page":"74-89","source":"Crossref","is-referenced-by-count":11,"title":["Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties"],"prefix":"10.1007","author":[{"given":"A-C","family":"Caron","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"unstructured":"Personnal communication.","key":"5_CR1"},{"doi-asserted-by":"crossref","unstructured":"Max Dauchet \u201cSimulation of Turing Machines by a left-linear rewrite rule\u201d Rewriting Techniques and Applications. 3rd international conference, RTA-89 Chapel Hill, North Carolina, USA, April 1989 Proceedings in LNCS 355 N. Dershowitz (Ed.) p 109\u2013120 (1987)","key":"5_CR2","DOI":"10.1007\/3-540-51081-8_103"},{"key":"5_CR3","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Nachum Dershowitz \u201cTermination of Rewriting\u201d J.Symbolic Computation (1987) 3, 69\u2013116","journal-title":"J.Symbolic Computation"},{"unstructured":"N. Dershowitz and J.P. Jouannaud \u201cRewrite systems\u201d Rapport de recherche 478. Unit\u00e9 associ\u00e9e au CNRS 410. (1989)","key":"5_CR4"},{"doi-asserted-by":"crossref","unstructured":"Philip K. Hooper \u201cThe undecidability of the Turing machine immortality problem\u201d J.Symbolic Logic 31 (2) June 1966. (1966)","key":"5_CR5","DOI":"10.2307\/2269811"},{"issue":"1","key":"5_CR6","first-page":"168","volume":"16","author":"J.E. Hopcroft","year":"1967","unstructured":"J.E. Hopcroft and J.D. Ullman \u201cSome results on tape-bounded Turing machines\u201d J.A.C.M. Vol 16 (1), January 1967, pp 168\u2013177.","journal-title":"J.A.C.M."},{"issue":"4","key":"5_CR7","first-page":"797","volume":"27","author":"G. Huet","year":"1980","unstructured":"G\u00e9rard Huet \u201cConfluent reductions: abstact ptoperties and applications to term rewriting systems\u201d J.A.C.M. Vol 27, (4), October 1980 pp 797\u2013821. (1980)","journal-title":"J.A.C.M."},{"key":"5_CR8","series-title":"Rapport laboria","volume-title":"On the uniform halting problem for term rewriting systems","author":"G. Huet","year":"1978","unstructured":"G. Huet and D.S. Lankford \u201cOn the uniform halting problem for term rewriting systems\u201d, Rapport laboria 283, Institut de Recherche en Informatique et en automatique, Le Chesnay, France, Mars 1978. (1978)"},{"key":"5_CR9","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0019-9958(64)90120-2","volume":"7","author":"S.-Y. Kuroda","year":"1964","unstructured":"S.-Y. Kuroda \u201cClasses of languages and linear-bounded automata\u201d Information and Controle 7, 207\u2013223 (1964).","journal-title":"Information and Controle"},{"unstructured":"Igor Litovsky and Yves Metivier \u201cComputing with graph rewriting systems with priorities\u201d Rapport interne LaBRI 90\u201387","key":"5_CR10"},{"key":"5_CR11","series-title":"WADD Tech. Note","volume-title":"Linear bounded automata","author":"J. Myhill","year":"1960","unstructured":"J. Myhill \u201cLinear bounded automata\u201d WADD Tech. Note No. 60-165, Wright-Patterson Air Force Base, Ohio. (1960)"},{"issue":"2","key":"5_CR12","doi-asserted-by":"crossref","first-page":"223","DOI":"10.2307\/1968867","volume":"43","author":"M.H.A. Newman","year":"1942","unstructured":"M.H.A. Newman \u201cOn theories with a combinatorial definition of equivalence\u201d Annals of Mathematics 43 (2), p. 223\u2013243. (1942)","journal-title":"Annals of Mathematics"},{"key":"5_CR13","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0022-0000(87)90017-1","volume":"35","author":"F. Otto","year":"1987","unstructured":"Friedrich Otto \u201cOn deciding the confluence of a finite string-rewriting system on a given congruence class\u201d J. Comput. System Sciences 35, 285\u2013310 (1987)","journal-title":"J. Comput. System Sciences"},{"key":"5_CR14","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E. L. Post","year":"1946","unstructured":"Emil L. Post \u201cA variant of a recursively unsolvable problem\u201d. Bulletin of the American Mathematical Society 52 p 264\u2013268. (1946)","journal-title":"Bulletin of the American Mathematical Society"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-53982-4_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:34:29Z","timestamp":1640921669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-53982-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539827","9783540465638"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-53982-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}