{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T18:35:38Z","timestamp":1757615738992,"version":"3.44.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,3,1]],"date-time":"1995-03-01T00:00:00Z","timestamp":794016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,4,5]],"date-time":"2000-04-05T00:00:00Z","timestamp":954892800000},"content-version":"vor","delay-in-days":1862,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1995,3]]},"DOI":"10.1016\/0020-0190(94)00218-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T11:53:20Z","timestamp":1027598000000},"page":"315-320","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Decreasing the bandwidth of a transition matrix"],"prefix":"10.1016","volume":"53","author":[{"given":"Ioan I.","family":"Macarie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(94)00218-N_BIB1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","article-title":"Parallel computation for well-endowed rings and space-bounded probabilistic machines","volume":"48","author":"Borodin","year":"1983","journal-title":"Inform. and Control"},{"key":"10.1016\/0020-0190(94)00218-N_BIB2","series-title":"Proc. MFCS","first-page":"33","article-title":"Probabilistic two-way machines","volume":"118","author":"Freivalds","year":"1981"},{"key":"10.1016\/0020-0190(94)00218-N_BIB3","series-title":"Baltic Computer Science, Selected Papers","first-page":"565","article-title":"Complexity of probabilistic versus deterministic automata","volume":"502","author":"Freivalds","year":"1991"},{"key":"10.1016\/0020-0190(94)00218-N_BIB4","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1137\/0206049","article-title":"Computational complexity of probabilistic Turing machines","volume":"6","author":"Gill","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(94)00218-N_BIB5","series-title":"Proc. MFCS","first-page":"339","article-title":"Relationships between probabilistic and deterministic tape complexity","volume":"118","author":"Jung","year":"1981"},{"key":"10.1016\/0020-0190(94)00218-N_BIB6","series-title":"Proc. ICALP","first-page":"281","article-title":"On probabilistic tape complexity and fast circuits for matrix inversion problems","volume":"172","author":"Jung","year":"1984"},{"key":"10.1016\/0020-0190(94)00218-N_BIB7","series-title":"IEEE Conf. Record on Switching Circuit Theory and Logical Design","first-page":"191","article-title":"Memory bounds for recognition of context-free and context-sensitive languages","author":"Lewis","year":"1965"},{"key":"10.1016\/0020-0190(94)00218-N_BIB8","series-title":"Proc. STACS","first-page":"109","article-title":"Space-efficient deterministic simulations of probabilistic automata","volume":"775","author":"Macarie","year":"1994"},{"key":"10.1016\/0020-0190(94)00218-N_BIB9_1","series-title":"Proc. STOC","first-page":"215","article-title":"Space-bounded hierarchies and probabilistic computation","author":"Ruzzo","year":"1982"},{"key":"10.1016\/0020-0190(94)00218-N_BIB9_2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0022-0000(84)90066-7","volume":"28","author":"Ruzzo","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00218-N_BIB10","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/S0022-0000(70)80006-X","article-title":"Relationships between nondeterministic and deterministic tape complexity","volume":"4","author":"Savitch","year":"1970","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(94)00218-N_BIB11","series-title":"Proc. ICALP 1977","first-page":"480","article-title":"On the difference between one and many","volume":"52","author":"Simon","year":"1977"},{"key":"10.1016\/0020-0190(94)00218-N_BIB12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0304-3975(81)90032-3","article-title":"On tape-bounded probabilistic Turing machine acceptors","volume":"16","author":"Simon","year":"1981","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400218N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909400218N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T14:58:30Z","timestamp":1757084310000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909400218N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,3]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1995,3]]}},"alternative-id":["002001909400218N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(94)00218-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1995,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Decreasing the bandwidth of a transition matrix","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(94)00218-N","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}