{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:40:43Z","timestamp":1737006043225,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679011"},{"type":"electronic","value":"9783540446125"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44612-5_9","type":"book-chapter","created":{"date-parts":[[2007,5,5]],"date-time":"2007-05-05T13:28:20Z","timestamp":1178371700000},"page":"132-140","source":"Crossref","is-referenced-by-count":14,"title":["On the Lower Bounds for One-Way Quantum Automata"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aida","family":"Gainutdinova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"9_CR1","unstructured":"P. Alexandrov, Introduction to set theory and general topology, Moscow, Nauka, 1977 (in Russian)."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"A. Ambainis and R. Freivalds, 1-way quantum finite automata: strengths, weaknesses and generalization, In Proceeding of the 39th IEEE Conference on Foundation of Computer Science, 1998, 332\u2013342. See also quant-ph\/9802062 v3","DOI":"10.1109\/SFCS.1998.743469"},{"key":"9_CR3","unstructured":"A. Brodsky and N. Pippenger, Characterizations of 1-way quantum finite automata, quant-ph\/9903014, 1999"},{"key":"9_CR4","unstructured":"http:\/\/xxx.lanl.gov\/archive\/quant-ph . See also its Russian mirror: http:\/\/xxx.itep.ru ."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"A. Kondacs, J. Watrous, On the power of quantum finite state automata. In Proceeding of the 38th IEEE Conference on Foundation of Computer Science, 1997, 66\u201375.","DOI":"10.1109\/SFCS.1997.646094"},{"key":"9_CR6","unstructured":"C. Moore and J. Crutchfield, Quantum automata and quantum grammars, quant-ph\/9707031"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"A. Nayak, Optimal lower bounds for quantum automata and random access codes, Proceeding of the 40th IEEE Conference on Foundation of Computer Science, 1999, 369\u2013376. See also quant-ph\/9904093","DOI":"10.1109\/SFFCS.1999.814608"},{"issue":"5","key":"9_CR8","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. on Computing, 26(5), 1997, 1484\u20131509.","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44612-5_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T02:15:56Z","timestamp":1736993756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44612-5_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679011","9783540446125"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-44612-5_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}