{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:38:17Z","timestamp":1725496697787},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_43","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"436-446","source":"Crossref","is-referenced-by-count":2,"title":["One-Way Probabilistic Reversible and Quantum One-Counter Automata"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"43_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-48686-0_17","volume-title":"Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON\u201999)","author":"A. Ambainis","year":"1999","unstructured":"A. Ambainis, R. Bonner, R. Freivalds, and A. Kikusts. Probabilities to accept languages by quantum finite automata. In Proceedings of the 5th Annual International Conference on Computing and Combinatorics (COCOON\u201999), Lecture Notes in Computer Science, volume 1627, pages 174\u2013183, 1999."},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"A. Ambainis and R. Freivalds. 1-way quantum finite automata: Strengths, weakness and generalizations. In Proceedings of the 39th Annual Symposium on Foundation of Computer Science, pages 332\u2013341, 1998.","DOI":"10.1109\/SFCS.1998.743469"},{"key":"43_CR3","doi-asserted-by":"crossref","unstructured":"A. Kondacs and J. Watrous. On the Power of Quantum Finite State Automata. In Proceedings of the 38th Annual Symposium on Foundation of Computer Science, pages 66\u201375, 1997.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"43_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1007\/3-540-47849-3_31","volume-title":"Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics (SOF-SEM\u201999)","author":"M. Kravtsev","year":"1999","unstructured":"M. Kravtsev. Quantum finite one-counter automata. In Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics (SOF-SEM\u201999), Lecture Notes in Computer Science, volume 1725, pages 431\u2013440, 1999."},{"issue":"3","key":"43_CR5","doi-asserted-by":"publisher","first-page":"437","DOI":"10.2307\/1970290","volume":"74","author":"M. L. Minsky","year":"1961","unstructured":"M. L. Minsky. Recursive unsolvability of post\u2019s problem of \u2018tag\u2019 and other topics in the theory of turing machines. Annals of Math., 74:3:437\u2013455, 1961.","journal-title":"Annals of Math."},{"key":"43_CR6","unstructured":"C. Moore and J. Crutchfield. Quantum automata and quantum grammars. Technical Report 97-07-02, Santa-Fe Institute Working Paper, 1997. Also available at \n                    http:\/\/xxx.lanl.gov\/archive\/quant-ph\/9707031\n                    \n                  ."},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"A. Nayak. Optimal lower bounds for quantum automata and random access codes. In Proceedings of the 40th Annual Symposium on Foundation of Computer Science, pages 369\u2013376, 1999.","DOI":"10.1109\/SFFCS.1999.814608"},{"key":"43_CR8","doi-asserted-by":"crossref","unstructured":"P. Shor. Algorithms for quantum computation: Discrete log and factoring. In Proceedings of the 35th Annual Symposium on Foundation of Computer Science, pages 56\u201365, 1994.","DOI":"10.1109\/SFCS.1994.365700"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T18:45:34Z","timestamp":1551120334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_43","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}