{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:25:01Z","timestamp":1725600301007},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642229923"},{"type":"electronic","value":"9783642229930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22993-0_33","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:44:46Z","timestamp":1312893886000},"page":"351-363","source":"Crossref","is-referenced-by-count":3,"title":["Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages"],"prefix":"10.1007","author":[{"given":"Marats","family":"Golovkins","sequence":"first","affiliation":[]},{"given":"Maksim","family":"Kravtsev","sequence":"additional","affiliation":[]},{"given":"Vasilijs","family":"Kravcevs","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00224-005-1263-x","volume":"39","author":"A. Ambainis","year":"2006","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., \u0136ikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic Results on Quantum Automata. Theory of Computing Systems\u00a039(1), 165\u2013188 (2006)","journal-title":"Theory of Computing Systems"},{"key":"33_CR2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-Way Quantum Finite Automata: Strengths, Weaknesses and Generalizations. In: Proc. 39th FOCS, pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"33_CR3","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., \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)"},{"key":"33_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2010-333","volume":"104","author":"M.P. Bianchi","year":"2010","unstructured":"Bianchi, M.P., Palano, B.: Behaviours of Unary Quantum Automata. Fundamenta Informaticae\u00a0104, 1\u201315 (2010)","journal-title":"Fundamenta Informaticae"},{"issue":"5","key":"33_CR5","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":"33_CR6","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0B. Academic Press, New York (1976)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1007\/3-540-45655-4_61","volume-title":"Computing and Combinatorics","author":"M. Golovkins","year":"2002","unstructured":"Golovkins, M., Kravtsev, M.: Probabilistic Reversible Automata and Quantum Automata. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 574\u2013583. Springer, Heidelberg (2002)"},{"issue":"20","key":"33_CR8","doi-asserted-by":"publisher","first-page":"1942","DOI":"10.1016\/j.tcs.2009.01.042","volume":"410","author":"M. Golovkins","year":"2009","unstructured":"Golovkins, M., Kravtsev, M., Kravcevs, V.: On a Class of Languages Recognizable by Probabilistic Reversible Decide-and-Halt Automata. Theoretical Computer Science\u00a0410(20), 1942\u20131951 (2009)","journal-title":"Theoretical Computer Science"},{"key":"33_CR9","first-page":"2","volume":"2","author":"M. Golovkins","year":"2010","unstructured":"Golovkins, M., Pin, J.E.: Varieties Generated by Certain Models of Reversible Finite Automata. Chicago Journal of Theoretical Computer Science 2010, Article 2 (2010)","journal-title":"Chicago Journal of Theoretical Computer Science"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.4018\/jncr.2010010104","volume":"1","author":"M. Hirvensalo","year":"2010","unstructured":"Hirvensalo, M.: Quantum Automata with Open Time Evolution. International Journal of Natural Computing Research\u00a01(1), 70\u201385 (2010)","journal-title":"International Journal of Natural Computing Research"},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On The Power of Quantum Finite State Automata. In: Proc. 38th FOCS, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"33_CR12","doi-asserted-by":"publisher","first-page":"1465","DOI":"10.1109\/TIT.2003.811917","volume":"49-6","author":"G. Kuperberg","year":"2003","unstructured":"Kuperberg, G.: The Capacity of Hybrid Quantum Memory. IEEE Transactions on Information Theory\u00a049-6, 1465\u20131473 (2003)","journal-title":"IEEE Transactions on Information Theory"},{"key":"33_CR13","unstructured":"Li, L., Qiu, D., Zou, X., Li, L., Wu, L., Mateus, P.: Characterizations of One-Way General Quantum Finite Automata (2010), http:\/\/arxiv.org\/abs\/0911.3266"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-540-88282-4_34","volume-title":"Language and Automata Theory and Applications","author":"M. Mercer","year":"2008","unstructured":"Mercer, M.: Lower Bounds for Generalized Quantum Finite Automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol.\u00a05196, pp. 373\u2013384. Springer, Heidelberg (2008)"},{"issue":"1-2","key":"33_CR15","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":"33_CR16","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: Varieties of Formal Languages, North Oxford, London and Plenum, New-York (1986)","DOI":"10.1007\/978-1-4613-2215-3"},{"key":"33_CR18","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-94-011-0149-3_2","volume-title":"NATO Advanced Study Institute. Semigroups, Formal Languages and Groups","author":"J.E. Pin","year":"1995","unstructured":"Pin, J.E.: BG = PG, a Success Story. In: Fountain, J. (ed.) NATO Advanced Study Institute. Semigroups, Formal Languages and Groups, pp. 33\u201347. Kluwer Academic Publishers, Boston (1995)"},{"key":"33_CR19","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1017\/S1446788700022084","volume":"37","author":"J.E. Pin","year":"1984","unstructured":"Pin, J.E., Straubing, H., Th\u00e9rien, D.: Small Varieties of Finite Semigroups and Extensions. J. Austral. Math. Soc (Series A)\u00a037, 269\u2013281 (1984)","journal-title":"J. Austral. Math. Soc. (Series A)"},{"issue":"3","key":"33_CR20","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M.O. Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic Automata. Information and Control\u00a06(3), 230\u2013245 (1963)","journal-title":"Information and Control"},{"issue":"1","key":"33_CR21","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/BF01691347","volume":"2","author":"G. Thierrin","year":"1968","unstructured":"Thierrin, G.: Permutation Automata. Mathematical Systems Theory\u00a02(1), 83\u201390 (1968)","journal-title":"Mathematical Systems Theory"},{"key":"33_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-5797-2","volume-title":"Matrix Theory: Basic Results and Techniques","author":"F. Zhang","year":"1999","unstructured":"Zhang, F.: Matrix Theory: Basic Results and Techniques. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22993-0_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:10:14Z","timestamp":1606187414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22993-0_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229923","9783642229930"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22993-0_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}