{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:36Z","timestamp":1760202576128,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540857792"},{"type":"electronic","value":"9783540857808"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85780-8_2","type":"book-chapter","created":{"date-parts":[[2008,9,9]],"date-time":"2008-09-09T05:23:54Z","timestamp":1220937834000},"page":"21-33","source":"Crossref","is-referenced-by-count":9,"title":["Various Aspects of Finite Quantum Automata"],"prefix":"10.1007","author":[{"given":"Mika","family":"Hirvensalo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/3-540-44612-5_9","volume-title":"Mathematical Foundations of Computer Science 2000","author":"F. Ablayev","year":"2000","unstructured":"Ablayev, F., Gainutdinova, A.: On the Lower Bounds for One-Way Quantum Automata. In: Nielsen, M., Rovan, B. (eds.) MFCS 2000. LNCS, vol.\u00a01893, pp. 132\u2013140. Springer, Heidelberg (2000)"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., \u0136ikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic Results on Quantum Automata. Theory of Computing Systems\u00a039, 165\u2013188 (2006)","DOI":"10.1007\/s00224-005-1263-x"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Bonner R\u016bsi\u0146\u0161, R.F., \u0136ikusts, A.: Probabilities to Accept Languages by Quantum Finite Automata. In: Asano, T., Imai, H., Lee, D.T., Nakano, S.-i., Tokuyama, T. (eds.) COCOON 1999. LNCS, vol.\u00a01627, pp. 174\u2013185. Springer, Heidelberg (1999)","DOI":"10.1007\/3-540-48686-0_17"},{"key":"2_CR4","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proceedings of the 39th FOCS, pp. 376\u2013383 (1998)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., \u0136ikusts, A., Valdats, M.: On the class of languages recognizable by 1-way quantum finite automata. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol.\u00a02010, pp. 75\u201386. Springer, Heidelberg (2001)","DOI":"10.1007\/3-540-44693-1_7"},{"issue":"1","key":"2_CR6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0304-3975(02)00393-6","volume":"295","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A., \u0136ikusts, A.: Exact results for accepting probabilities of quantum automata. Theoretical Computer Science\u00a0295(1), 3\u201325 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"5","key":"2_CR7","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E. Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM Journal on Computing\u00a026(5), 1411\u20131473 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s00224-003-1061-2","volume":"36","author":"V.D. Blondel","year":"2003","unstructured":"Blondel, V.D., Canterini, V.: Undecidable problems for probabilistic automata of fixed dimension. Theory of Computing systems\u00a036, 231\u2013245 (2003)","journal-title":"Theory of Computing systems"},{"issue":"6","key":"2_CR9","doi-asserted-by":"publisher","first-page":"1464","DOI":"10.1137\/S0097539703425861","volume":"34","author":"V.D. Blondel","year":"2005","unstructured":"Blondel, V.D., Jeandel, E., Koiran, P., Portier, N.: Decidable and undecidable problems about quantum automata. SIAM Journal on Computing\u00a034(6), 1464\u20131473 (2005)","journal-title":"SIAM Journal on Computing"},{"issue":"5","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-Way Quantum Finite Automata. SIAM Journal on Computing\u00a031(5), 1456\u20131478 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A. Church","year":"1936","unstructured":"Church, A.: An unsolvable problem in elementary number theory. American Journal of Mathematics\u00a058, 345\u2013363 (1936)","journal-title":"American Journal of Mathematics"},{"key":"2_CR12","unstructured":"Clay Mathematics Institute, http:\/\/www.claymath.org\/"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1145\/800157.805047","volume-title":"Proceedings of the Third Annual ACM Symposium on the Theory of Computing","author":"S.A. Cook","year":"1971","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the Third Annual ACM Symposium on the Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D. Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proceedings of the Royal Society of London A\u00a0400, 97\u2013117 (1985)","journal-title":"Proceedings of the Royal Society of London A"},{"key":"2_CR15","volume-title":"Automata, languages, and machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, languages, and machines, vol.\u00a0A. Academic Press, London (1974)"},{"issue":"6\/7","key":"2_CR16","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"R.P. Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. International Journal of Theoretical Physics\u00a021(6\/7), 467\u2013488 (1982)","journal-title":"International Journal of Theoretical Physics"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-73208-2_18","volume-title":"Developments in Language Theory","author":"R. Freivalds","year":"2007","unstructured":"Freivalds, R.: Non-constructive Methods for Finite Probabilistic Automata. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol.\u00a04588, pp. 169\u2013180. Springer, Heidelberg (2007)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/BF01700692","volume":"38","author":"K. G\u00f6del","year":"1931","unstructured":"G\u00f6del, K.: \u00dcber formal unentscheidbare S\u00e4tze der Principia Mathematica und verwandter Systeme I. Monatshefte f\u00fcr Mathematik und Physik\u00a038, 173\u2013198 (1931)","journal-title":"Monatshefte f\u00fcr Mathematik und Physik"},{"key":"2_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09636-9","volume-title":"Quantum Computing","author":"M. Hirvensalo","year":"2004","unstructured":"Hirvensalo, M.: Quantum Computing, 2nd edn. Springer, Heidelberg (2004)","edition":"2"},{"key":"2_CR20","volume-title":"Current Trends in Theoretical Computer Science \u2013 The Challenge of the New Century","author":"M. Hirvensalo","year":"2004","unstructured":"Hirvensalo, M.: Some Open Problems Related to Quantum Computing. In: Paun, G., Rozenberg, G., Salomaa, A. (eds.) Current Trends in Theoretical Computer Science \u2013 The Challenge of the New Century, vol.\u00a01. World Scientific, Singapore (2004)"},{"key":"2_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-69507-3_25","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"M. Hirvensalo","year":"2007","unstructured":"Hirvensalo, M.: Improved Undecidability Results on the Emptiness Problem of Probabilistic and Quantum Cut-Point Languages. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 309\u2013319. Springer, Heidelberg (2007)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"issue":"1","key":"2_CR23","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.tcs.2004.09.016","volume":"330","author":"Y. Matiyasevich","year":"2005","unstructured":"Matiyasevich, Y., S\u00e9nizergues, G.: Decision problems for semi-Thue systems with a few rules. Theoretical Computer Science\u00a0330(1), 145\u2013169 (2005)","journal-title":"Theoretical Computer Science"},{"issue":"1-2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.P.: Quantum automata and quantum grammars. Theoretical Computer Science\u00a0237(1-2), 275\u2013306 (2000)","journal-title":"Theoretical Computer Science"},{"key":"2_CR25","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/sapm1970491105","volume":"49","author":"M.S. Paterson","year":"1970","unstructured":"Paterson, M.S.: Unsolvability in 3 X 3 matrices. Studies in Applied Mathematics\u00a049, 105\u2013107 (1970)","journal-title":"Studies in Applied Mathematics"},{"key":"2_CR26","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, London (1971)"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1090\/S0002-9904-1946-08555-9","volume":"52","author":"E.L. Post","year":"1946","unstructured":"Post, E.L.: A variant of a recursively unsolvable problem. Bulletin of American Mathematical Society\u00a052, 264\u2013268 (1946)","journal-title":"Bulletin of American Mathematical Society"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1006\/jcss.1997.1494","volume":"55","author":"A.A. Razborov","year":"1997","unstructured":"Razborov, A.A., Rudich, S.: Natural Proofs. Journal of Computer and System Sciences\u00a055, 24\u201325 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Tarski, A.: A decision method for elementary algebra and geometry. University of California Press (1951)","DOI":"10.1525\/9780520348097"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"303","DOI":"10.2307\/2036989","volume":"21","author":"P. Turakainen","year":"1969","unstructured":"Turakainen, P.: Generalized automata and stochastic languages. Proceedings of American Mathematical Society\u00a021, 303\u2013309 (1969)","journal-title":"Proceedings of American Mathematical Society"},{"issue":"42","key":"2_CR31","first-page":"230","volume":"2","author":"A.M. Turing","year":"1936","unstructured":"Turing, A.M.: On Computable Numbers, With an Application to the Entscheidungsproblem. Proc. London Math. Soc.\u00a02(42), 230\u2013265 (1936)","journal-title":"Proc. London Math. Soc."},{"key":"2_CR32","series-title":"Word, Language, Grammar","volume-title":"Handbook of Formal Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Regular Languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages. Word, Language, Grammar, vol.\u00a01, Springer, Heidelberg (1997)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85780-8_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,31]],"date-time":"2025-01-31T21:41:48Z","timestamp":1738359708000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-85780-8_2"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540857792","9783540857808"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85780-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}