{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T04:19:36Z","timestamp":1745986776805,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642357367"},{"type":"electronic","value":"9783642357374"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35737-4_2","type":"book-chapter","created":{"date-parts":[[2013,1,10]],"date-time":"2013-01-10T01:12:22Z","timestamp":1357780342000},"page":"19-38","source":"Crossref","is-referenced-by-count":0,"title":["Abstract Quantum Automata as Formal Models of Quantum Information Processing Systems"],"prefix":"10.1007","author":[{"given":"Mizal","family":"Alobaidi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andriy","family":"Batyiv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Grygoriy","family":"Zholtkevych","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: Proc. 39th Ann. Symp. on Found. Comp. Sci., pp. 332\u2013341. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1038\/37539","volume":"390","author":"D. Bouwmeester","year":"1997","unstructured":"Bouwmeester, D., Pan, J.-W., Mattle, K., Eible, M., Weinfurter, H., Zeilinger, A.: Experimental quantum teleportation. Nature\u00a0390, 575\u2013579 (1997)","journal-title":"Nature"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"1121","DOI":"10.1103\/PhysRevLett.80.1121","volume":"80","author":"D. Boschi","year":"1998","unstructured":"Boschi, D., Branca, S., De Martini, F., Hardy, L., Popescu, S.: Experimental Realization of Teleporting an Unknown Pure Quantum State via Dual Classical and Einstein\u2013Podolsky\u2013Rosen Channel. Phys. Rev. Lett.\u00a080, 1121\u20131125 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"2","key":"2_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.2307\/2371045","volume":"58","author":"A. Church","year":"1936","unstructured":"Church, A.: An unsolvable problem of elementary number theory. Amer. J. Math.\u00a058(2), 345\u2013363 (1936)","journal-title":"Amer. J. Math."},{"key":"2_CR5","first-page":"151","volume-title":"Proc. 3rd Ann. ACM Symp. on Theory of Computing","author":"S. Cook","year":"1971","unstructured":"Cook, S.: The Complexity of Theorem Proving Procedures. In: Proc. 3rd Ann. ACM Symp. on Theory of Computing, pp. 151\u2013158. ACM, New York (1971)"},{"issue":"1818","key":"2_CR6","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. Proc. Roy. Soc. Lond., Series A\u00a0400(1818), 97\u2013117 (1985)","journal-title":"Proc. Roy. Soc. Lond., Series A"},{"issue":"1907","key":"2_CR7","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1098\/rspa.1992.0167","volume":"439","author":"D. Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid Solution of Problems by Quantum Computation. Proc. Roy. Soc. Lond., Series A\u00a0439(1907), 553\u2013558 (1992)","journal-title":"Proc. Roy. Soc. Lond., Series A"},{"key":"2_CR8","unstructured":"Dirac, P.A.M.: The Principles of Quantum Mechanics, 4th edn. Oxford University Press (1958)"},{"key":"2_CR9","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 Computer. Int. J. Theor. Phys.\u00a021, 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"key":"2_CR10","volume-title":"Probabilistic and Statistical Aspects of Quantum Theory","author":"A.S. Holevo","year":"1982","unstructured":"Holevo, A.S.: Probabilistic and Statistical Aspects of Quantum Theory. North-Holland Publishing Company, Amsterdam (1982)"},{"key":"2_CR11","series-title":"SIAM-AMS Proceedings","volume-title":"Complexity of Computation","author":"R.M. Karp","year":"1974","unstructured":"Karp, R.M.: Complexity of Computation. SIAM-AMS Proceedings, vol.\u00a07. AMS, Providence (1974)"},{"key":"2_CR12","unstructured":"Manin, Y.I.: Computable and Uncomputable (Cybernetics), Sovetskoe radio, Moscow (1980) (in Russian)"},{"key":"2_CR13","unstructured":"Manin, Y.I.: Mathematics as metaphor: selected essays of Yuri I. Manin. AMS (2007)"},{"key":"2_CR14","volume-title":"Communicating and Mobile System: the \u03c0-Calculus","author":"R. Milner","year":"1999","unstructured":"Milner, R.: Communicating and Mobile System: the \u03c0-Calculus. Cambridge University Press, Cambridge (1999)"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"99","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. Theoret. Comput. Sci.\u00a0237, 99\u2013136 (2000)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR16","volume-title":"Mathematische Grundlagen Der Quantenmechanik","author":"J. Neumann von","year":"1932","unstructured":"Neumann von, J.: Mathematische Grundlagen Der Quantenmechanik. Verlag von Julius Springer, Berlin (1932)"},{"key":"2_CR17","series-title":"10th Anniversary Edition","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511976667","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2010","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. 10th Anniversary Edition. Cambridge University Press, Cambridge (2010)"},{"key":"2_CR18","unstructured":"OMG Unified Modelling Language (OMG UML), Superstructure. OMG, v 2.4.1 (2011), http:\/\/www.omg.org\/spec\/UML\/2.4.1\/Superstructure\/PDF"},{"issue":"3","key":"2_CR19","doi-asserted-by":"publisher","first-page":"103","DOI":"10.2307\/2269031","volume":"1","author":"E.L. Post","year":"1936","unstructured":"Post, E.L.: Finite Combinatory Processes \u2013 Formulation 1. J. Symb. Logics.\u00a01(3), 103\u2013105 (1936)","journal-title":"J. Symb. Logics."},{"issue":"42","key":"2_CR20","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. Lond. Math. Soc.\u00a02(42), 230\u2013265 (1936)","journal-title":"Proc. Lond. Math. Soc."},{"issue":"4","key":"2_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.2307\/2268280","volume":"2","author":"A.M. Turing","year":"1937","unstructured":"Turing, A.M.: Computability and \u03bb-Definability. J. Symb. Logics.\u00a02(4), 153\u2013163 (1937)","journal-title":"J. Symb. Logics."}],"container-title":["Communications in Computer and Information Science","ICT in Education, Research, and Industrial Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35737-4_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,29]],"date-time":"2025-04-29T16:44:13Z","timestamp":1745945053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35737-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642357367","9783642357374"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35737-4_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}