{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:42:12Z","timestamp":1736314932819,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540310235"},{"type":"electronic","value":"9783540330974"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11605157_1","type":"book-chapter","created":{"date-parts":[[2006,3,1]],"date-time":"2006-03-01T15:07:40Z","timestamp":1141225660000},"page":"1-14","source":"Crossref","is-referenced-by-count":4,"title":["Languages Recognizable by Quantum Finite Automata"],"prefix":"10.1007","author":[{"given":"R\u016bsi\u0146\u0161","family":"Freivalds","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: Weak second-order arithmetic and finite automata. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a06, 66\u201392 (1960)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"1_CR2","first-page":"1","volume-title":"Proceeding of the International Congress on Logic, Methodology and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1960","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: Nagel, E. (ed.) Proceeding of the International Congress on Logic, Methodology and Philosophy of Science, pp. 1\u201311. Stanford University Press, Stanford (1960)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C.C. Elgot","year":"1961","unstructured":"Elgot, C.C.: Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc.\u00a098, 21\u201351 (1961)","journal-title":"Trans. Amer. Math. Soc."},{"key":"1_CR4","first-page":"103","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and the logic of one-place predicates. Siberian Mathematical Journal\u00a03, 103\u2013131 (1962) (in Russian); English translation: American Mathematical Society Translations 59, 23\u201355 (1966)","journal-title":"Siberian Mathematical Journal"},{"key":"1_CR5","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation. SIAM-AMS Proceedings, vol.\u00a07, pp. 43\u201373 (1974)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1002\/malq.19750210112","volume":"21","author":"R. Fagin","year":"1975","unstructured":"Fagin, R.: Monadic generalized spectra. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a021, 89\u201396 (1975)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"key":"1_CR7","volume-title":"Mathematical Foundations of Quantum Mechanics","author":"J. Neumann von","year":"1932","unstructured":"von Neumann, J.: Mathematical Foundations of Quantum Mechanics. Princeton University Press, Princeton (1932)"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A. Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N.H., Shor, P.W., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Physical Review A\u00a052, 3457\u20133467 (1995)","journal-title":"Physical Review A"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: Strengths, weaknesses and generalizations. In: Proc. FOCS 1998, pp. 332\u2013341 (1998), also quant-ph\/98020622","DOI":"10.1109\/SFCS.1998.743469"},{"key":"1_CR10","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. Theor. Comput. Sci.\u00a0237, 275\u2013306 (2000); also quant-ph\/9707031","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. FOCS 1997, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"1_CR12","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 J. Comput.\u00a031, 1456\u20131478 (2002); also quant-ph\/9903014","journal-title":"SIAM J. Comput."},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/BF01746516","volume":"3","author":"A.R. Meyer","year":"1969","unstructured":"Meyer, A.R., Thompson, C.: Remarks on algebraic decomposition of automata. Mathematical Systems Theory\u00a03, 110\u2013118 (1969)","journal-title":"Mathematical Systems Theory"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-48686-0_17","volume-title":"Computing and Combinatorics","author":"A. Ambainis","year":"1999","unstructured":"Ambainis, A., Bonner, R.F., Freivalds, R., Kikusts, 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\u2013183. Springer, Heidelberg (1999); also quant-ph\/9904066"},{"key":"1_CR15","unstructured":"Kikusts, A.: A small 1-way quantum finite automation (1998); quant-ph\/9810065"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/581771.581773","volume":"49","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and quantum finite automata. J. ACM\u00a049, 496\u2013511 (2002); also quant-ph\/9804043","journal-title":"J. ACM"},{"key":"1_CR17","unstructured":"Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proc. FOCS 1999, pp. 369\u2013377 (1999); also quant-ph\/9904093"},{"key":"1_CR18","first-page":"191","volume":"5","author":"J. Gruska","year":"2000","unstructured":"Gruska, J.: Descriptional complexity issues in quantum computing. Journal of Automata, Languages and Combinatorics\u00a05, 191\u2013218 (2000)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/3-540-44693-1_7","volume-title":"STACS 2001","author":"A. Ambainis","year":"2001","unstructured":"Ambainis, A., Kikusts, 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)"},{"key":"1_CR20","unstructured":"Valdats, M.: The class of languages recognizable by 1-way quantum finite automata is not closed under union. In: Proc. Int. Workshop Quantum Computation and Learning, Sundbyholm Slott, Sweden, pp. 52\u201364 (2000)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1007\/3-540-51498-8_23","volume-title":"Fundamentals of Computation Theory","author":"N. Immerman","year":"1989","unstructured":"Immerman, N.: Descriptive and computational complexity. In: Csirik, J.A., Demetrovics, J., Gecseg, F. (eds.) FCT 1989. LNCS, vol.\u00a0380, pp. 244\u2013245. Springer, Heidelberg (1989)"},{"key":"1_CR22","first-page":"1127","volume":"42","author":"N. Immerman","year":"1995","unstructured":"Immerman, N.: Descriptive complexity: A logician\u2019s approach to computation. Notices of the AMS\u00a042, 1127\u20131133 (1995)","journal-title":"Notices of the AMS"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: The temporal logic of programs. In: Proc. FOCS 1977, pp. 1\u201314 (1977)","DOI":"10.1109\/SFCS.1977.32"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J. Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable string transductions and two-way finite-state transducers. ACM Trans. Comput. Logic\u00a02, 216\u2013254 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L. Stockmeyer","year":"1977","unstructured":"Stockmeyer, L.: The polynomial-time hierarchy. Theoretical Computer Science\u00a03, 1\u201322 (1977)","journal-title":"Theoretical Computer Science"},{"key":"1_CR26","first-page":"147","volume-title":"Proc. STOC 1982","author":"N. Immerman","year":"1982","unstructured":"Immerman, N.: Relational queries computable in polynomial time (extended abstract). In: Proc. STOC 1982, pp. 147\u2013152. ACM Press, New York (1982)"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Vardi, M.Y.: Complexity of relational query languages. In: Proc. STOC 1982, pp. 137\u2013146 (1982)","DOI":"10.1145\/800070.802186"},{"key":"1_CR28","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/0022-0000(82)90011-3","volume":"25","author":"N. Immerman","year":"1982","unstructured":"Immerman, N.: Upper and lower bounds for first order expressibility. J. Comput. Syst. Sci.\u00a025, 76\u201398 (1982)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1016\/S0019-9958(65)90241-X","volume":"8","author":"L.A. Zadeh","year":"1965","unstructured":"Zadeh, L.A.: Fuzzy sets. Information and Control\u00a08, 338\u2013353 (1965)","journal-title":"Information and Control"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"1015","DOI":"10.1103\/PhysRevA.51.1015","volume":"51","author":"D.P.D. Vincenzo","year":"1995","unstructured":"Vincenzo, D.P.D.: Two-bit gates are universal for quantum computation. Physical Review A\u00a051, 1015\u20131022 (1995)","journal-title":"Physical Review A"},{"key":"1_CR31","doi-asserted-by":"crossref","unstructured":"Dzelme, I.: Quantum finite automata and logics. Master\u2019s thesis, University of Latvia, Advisor: Freivalds, R (2005)","DOI":"10.1007\/11611257_22"},{"key":"1_CR32","doi-asserted-by":"crossref","first-page":"12","DOI":"10.4064\/fm-44-1-12-36","volume":"44","author":"A. Mostowski","year":"1957","unstructured":"Mostowski, A.: On a generalization of quantifiers. Fundamenta Mathematicae\u00a044, 12\u201336 (1957)","journal-title":"Fundamenta Mathematicae"},{"key":"1_CR33","unstructured":"Burtschik, H.J., Vollmer, H.: Lindstr\u00f6m quantifiers and leaf language definability. In: Electronic Colloquium on Computational Complexity, TR96\u2013005 (1996)"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11605157_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T22:04:56Z","timestamp":1736287496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11605157_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540310235","9783540330974"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/11605157_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}