{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:37Z","timestamp":1725663277238},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540083535"},{"type":"electronic","value":"9783540372851"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1977]]},"DOI":"10.1007\/3-540-08353-7_176","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T16:25:39Z","timestamp":1330187139000},"page":"532-536","source":"Crossref","is-referenced-by-count":0,"title":["Real time computations with restrictions on tape alphabet"],"prefix":"10.1007","author":[{"given":"M. K.","family":"Valiev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,24]]},"reference":[{"key":"54_CR1","unstructured":"Matveeva, S. G. and Valiev, M. K., Some bounds of computational complexity for Turing machines. Intern. Congr. of Math., Abstracts, Section 13, Moscow, 1966. (Russian)."},{"key":"54_CR2","unstructured":"Seiferas, J. I., Fischer, M. J. and Meyer, A. R., Refinements of the hierarchies of time and tape complexities. 14th Annual Symp. on Switch. and Automata Theory, Iowa City, Iowa, 1973."},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/0203014","volume":"3","author":"O. H. Ibarra","year":"1974","unstructured":"Ibarra, O. H., A hierarchy theorem for polynomial-spase recognition. SIAM J. Comput., 3 (1974) 184\u2013187.","journal-title":"SIAM J. Comput."},{"key":"54_CR4","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1016\/S0022-0000(75)80049-3","volume":"11","author":"O. H. Ibarra","year":"1975","unstructured":"Ibarra, O. H. and Sahni, S. K., Hierarchies of Turing machines with restricted tape alphabet size. J. Comp. and Syst. Sci., 11 (1975) 56\u201367.","journal-title":"J. Comp. and Syst. Sci."},{"key":"54_CR5","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/BF02759719","volume":"1","author":"M. O. Rabin","year":"1963","unstructured":"Rabin, M. O., Real time computation. Israel J. Math., 1 (1963) 203\u2013211.","journal-title":"Israel J. Math."},{"key":"54_CR6","first-page":"47","volume":"4","author":"R. V. Freivald","year":"1965","unstructured":"Freivald, R. V., Complexity of palindrome recognition by Turing machines with input. Algebra and Logic, 4 (1965) 47\u201358 (Russian).","journal-title":"Algebra and Logic"},{"key":"54_CR7","unstructured":"Valiev, M. K., On time complexity of Turing machines with restrictions on tape alphabet. V All-Union Symp. on Cybernetics, Tbilisi, 1970 (Russian)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1977"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-08353-7_176.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:52:17Z","timestamp":1619556737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-08353-7_176"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977]]},"ISBN":["9783540083535","9783540372851"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-08353-7_176","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1977]]}}}