{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,29]],"date-time":"2022-12-29T21:31:40Z","timestamp":1672349500873},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"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":3942,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00412-1","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T19:19:50Z","timestamp":1034968790000},"page":"963-976","source":"Crossref","is-referenced-by-count":11,"title":["One-way probabilistic reversible and quantum one-counter automata"],"prefix":"10.1016","volume":"289","author":[{"given":"Tomohiro","family":"Yamasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hirotada","family":"Kobayashi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuuki","family":"Tokunaga","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00412-1_BIB1","first-page":"174","article-title":"Probabilities to accept languages by quantum finite automata","volume":"Vol. 1627","author":"Ambainis","year":"1999"},{"key":"10.1016\/S0304-3975(01)00412-1_BIB2","doi-asserted-by":"crossref","unstructured":"A. Ambainis, R. Freivalds, 1-way quantum finite automata: strengths, weakness and generalizations, in: Proc. 39th Annu. Symp. on Foundations of Computer Science, 1998, pp. 332\u2013341.","DOI":"10.1109\/SFCS.1998.743469"},{"key":"10.1016\/S0304-3975(01)00412-1_BIB3","doi-asserted-by":"crossref","unstructured":"A. Kondacs, J. Watrous, On the power of quantum finite state automata, in: Proc. 38th Annu. Symp. on Foundations of Computer Science, 1997, pp. 66\u201375.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"10.1016\/S0304-3975(01)00412-1_BIB4","first-page":"431","article-title":"Quantum finite one-counter automata","volume":"Vol. 1725","author":"Kravtsev","year":"1999"},{"issue":"3","key":"10.1016\/S0304-3975(01)00412-1_BIB5","doi-asserted-by":"crossref","first-page":"437","DOI":"10.2307\/1970290","article-title":"Recursive unsolvability of post's problem of \u2018tag\u2019 and other topics in the theory of Turing machines","volume":"74","author":"Minsky","year":"1961","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(01)00412-1_BIB6","unstructured":"C. Moore, J. Crutchfield, Quantum automata and quantum grammars, Technical Report, 97-07-02, Santa-Fe Institute Working Paper, also available at \\tt http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9707031, 1997."},{"key":"10.1016\/S0304-3975(01)00412-1_BIB7","doi-asserted-by":"crossref","unstructured":"A. Nayak, Optimal lower bounds for quantum automata and random access codes, in: Proc. 40th Annu. Symp. on Foundations of Computer Science, 1999, pp. 369\u2013376.","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"10.1016\/S0304-3975(01)00412-1_BIB8","doi-asserted-by":"crossref","unstructured":"P. Shor, Algorithms for quantum computation: discrete log and factoring, in: Proc. 35th Annu. Symp. on Foundations of Computer Science, 1994, pp. 56\u201365.","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004121?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004121?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:23:50Z","timestamp":1556465030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004121"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004121"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00412-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}