{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,6]],"date-time":"2026-07-06T15:39:08Z","timestamp":1783352348030,"version":"3.54.6"},"reference-count":28,"publisher":"IGI Global Scientific Publishing","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,1,1]]},"abstract":"<p>In this paper, a model for finite automaton with an open quantum evolution is introduced, and its basic properties are studied. It is shown that the (fuzzy) languages accepted by open evolution quantum automata obey various closure properties. More importantly, it is shown that major other models of finite automata, including probabilistic, measure once quantum, measure many quantum, and Latvian quantum automata can be simulated by the open quantum evolution automata without increasing the number of the states.<\/p>","DOI":"10.4018\/jncr.2010010104","type":"journal-article","created":{"date-parts":[[2010,4,19]],"date-time":"2010-04-19T09:09:50Z","timestamp":1271668190000},"page":"70-85","source":"Crossref","is-referenced-by-count":44,"title":["Quantum Automata with Open Time Evolution"],"prefix":"10.4018","volume":"1","author":[{"given":"Mika","family":"Hirvensalo","sequence":"first","affiliation":[{"name":"University of Turku, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"2432","reference":[{"key":"jncr.2010010104-0","doi-asserted-by":"crossref","unstructured":"Ablayev, F., & Gainutdinova, A. (2000). On the Lower Bounds for One-Way Quantum Automata (LNCS 1893, pp. 132-140). New York: Springer.","DOI":"10.1007\/3-540-44612-5_9"},{"key":"jncr.2010010104-1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-005-1263-x"},{"key":"jncr.2010010104-2","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Bonner, R. F., Freivalds, R., & Kikusts, A. (1999). Probabilities to Accept Languages by Quantum Finite Automata. In Proceedings of the International Computing and Combinatorics Conference (COCOON) (pp. 174-185).","DOI":"10.1007\/3-540-48686-0_17"},{"key":"jncr.2010010104-3","doi-asserted-by":"crossref","unstructured":"Ambainis, A., & Freivalds, R. (1998). 1-way quantum finite automata: strengths, weaknesses and generalizations. In Proceedings of the 39th FOCS (pp. 376-383).","DOI":"10.1109\/SFCS.1998.743469"},{"key":"jncr.2010010104-4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00393-6"},{"key":"jncr.2010010104-5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Kikusts, A., & Valdats, M. (2001). On the class of languages recognizable by 1-way quantum finite automata (LNCS 2010, pp. 75-86). New York: Springer.","DOI":"10.1007\/3-540-44693-1_7"},{"key":"jncr.2010010104-6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01011339"},{"key":"jncr.2010010104-7","doi-asserted-by":"publisher","DOI":"10.1007\/BF01857725"},{"key":"jncr.2010010104-8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"jncr.2010010104-9","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-003-1061-2"},{"key":"jncr.2010010104-10","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799353443"},{"key":"jncr.2010010104-11","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1985.0070"},{"key":"jncr.2010010104-12","volume":"Vol. A","author":"S.Eilenberg","year":"1974","journal-title":"Automata, languages, and machines"},{"key":"jncr.2010010104-13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"jncr.2010010104-14","doi-asserted-by":"crossref","unstructured":"Freivalds, R. (1981). Probabilistic two-way machines. In Proceedings of MFCS 1981 (LNCS 118, pp. 33-45). New York: Springer.","DOI":"10.1007\/3-540-10856-4_72"},{"key":"jncr.2010010104-15","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054108005826"},{"key":"jncr.2010010104-16","doi-asserted-by":"crossref","unstructured":"Grover, L. K. (1996). A fast quantum-mechanical algorithm for database search. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing - STOC (pp. 212-219).","DOI":"10.1145\/237814.237866"},{"key":"jncr.2010010104-17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09636-9","author":"M.Hirvensalo","year":"2004","journal-title":"Quantum Computing"},{"key":"jncr.2010010104-18","doi-asserted-by":"crossref","DOI":"10.1142\/9789812562494_0026","article-title":"Some Open Problems Related to Quantum Computing","volume":"Vol. 1","author":"M.Hirvensalo","year":"2004","journal-title":"Current Trends in Theoretical Computer Science \u2013 The Challenge of the New Century"},{"key":"jncr.2010010104-19","doi-asserted-by":"crossref","unstructured":"Hirvensalo, M. (2008). Various Aspects of Finite Quantum Automata. In Proceedings of DLT 2008 (LNCS 5257, pp. 21-33). New York: Springer.","DOI":"10.1007\/978-3-540-85780-8_2"},{"key":"jncr.2010010104-20","doi-asserted-by":"crossref","unstructured":"Kondacs, A., & Watrous, J. (1997). On the power of quantum finite state automata. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (pp. 66-75).","DOI":"10.1109\/SFCS.1997.646094"},{"key":"jncr.2010010104-21","author":"W.Kuich","year":"1986","journal-title":"Semirings, Automata and Languages. Eatcs Monographs on Theoretical Computer Science 5"},{"key":"jncr.2010010104-22","author":"Y. I.Manin","year":"1980","journal-title":"Computable and uncomputable"},{"key":"jncr.2010010104-23","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00191-1"},{"key":"jncr.2010010104-24","first-page":"273","article-title":"Thermodynamik quantummechanischer Gesamheiten.","volume":"1","author":"J. V.Neumann","year":"1927","journal-title":"Nachrichten von der Gesellschaft der Wissenschaften zu G\u00f6ttingen"},{"key":"jncr.2010010104-25","author":"A.Paz","year":"1971","journal-title":"Introduction to Probabilistic Automata"},{"key":"jncr.2010010104-26","doi-asserted-by":"crossref","unstructured":"Shor, P. W. (1994). Algorithms for quantum computation: discrete log and factoring. In Proceedings of the 35th Annual Symposium on the Foundations of Computer Science (pp. 20-22).","DOI":"10.1109\/SFCS.1994.365700"},{"key":"jncr.2010010104-27","doi-asserted-by":"crossref","unstructured":"Yu, S. (1997). Formal Languages. In G. Rozenberg & A. Salomaa (Eds.), Hanbook of Formal Languages: Volume 1. Word, Language, Grammar. New York: Springer.","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["International Journal of Natural Computing Research"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=41945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T20:00:55Z","timestamp":1654113655000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/jncr.2010010104"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"URL":"https:\/\/doi.org\/10.4018\/jncr.2010010104","relation":{},"ISSN":["1947-928X","1947-9298"],"issn-type":[{"value":"1947-928X","type":"print"},{"value":"1947-9298","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}