{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:09:52Z","timestamp":1775279392595,"version":"3.50.1"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030040697","type":"print"},{"value":"9783030040703","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04070-3_21","type":"book-chapter","created":{"date-parts":[[2018,11,21]],"date-time":"2018-11-21T08:56:27Z","timestamp":1542790587000},"page":"266-278","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Classically Time-Controlled Quantum Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5175-6882","authenticated-orcid":false,"given":"Alejandro","family":"D\u00edaz-Caro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6081-9099","authenticated-orcid":false,"given":"Marcos","family":"Villagra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,22]]},"reference":[{"key":"21_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: Strengths, weaknesses and generalizations. In: Proceedings of the 39th Annual Symposium on Foundations of Computer Science (FOCS), pp. 332\u2013341 (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"issue":"1","key":"21_CR2","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/S0304-3975(02)00138-X","volume":"287","author":"A Ambainis","year":"2002","unstructured":"Ambainis, A., Watrous, J.: Two-way finite automata with quantum and classical states. Theor. Comput. Sci. 287(1), 299\u2013311 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"21_CR3","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. 31(5), 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-319-71237-6_22","volume-title":"Programming Languages and Systems (APLAS 2017)","author":"A D\u00edaz-Caro","year":"2017","unstructured":"D\u00edaz-Caro, A.: A lambda calculus for density matrices with classical and probabilistic controls. In: Chang, B.Y.E. (ed.) Programming Languages and Systems (APLAS 2017). Lecture Notes in Computer Science, vol. 10695, pp. 448\u2013467. Springer, Cham (2017)"},{"key":"21_CR5","doi-asserted-by":"crossref","unstructured":"Green, A.S., Lumsdaine, P.L., Ross, N.J., Selinger, P., Valiron, B.: Quipper: a scalable quantum programming language. In: ACM SIGPLAN Notices (PLDI 2013), vol. 48, no. 6, pp. 333\u2013342 (2013)","DOI":"10.1145\/2499370.2462177"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Knill, E.H.: Conventions for quantum pseudocode. Technical report LA-UR-96-2724, Los Alamos National Laboratory (1996)","DOI":"10.2172\/366453"},{"issue":"1\u20132","key":"21_CR7","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. 237(1\u20132), 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"21_CR8","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/j.jcss.2008.12.001","volume":"75","author":"H Nishimura","year":"2009","unstructured":"Nishimura, H., Yamakami, T.: An application of quantum finite automata to interactive proof systems. J. Comput. Syst. Sci. 75(4), 255\u2013269 (2009)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Paykin, J., Rand, R., Zdancewic, S.: Qwire: a core language for quantum circuits. In: Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, POPL 2017, pp. 846\u2013858. ACM, New York (2017)","DOI":"10.1145\/3009837.3009894"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-319-13350-8_16","volume-title":"Computing with New Resources","author":"ACC Say","year":"2014","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Quantum finite automata: a modern introduction. In: Calude, C.S., Freivalds, R., Kazuo, I. (eds.) Computing with New Resources. LNCS, vol. 8808, pp. 208\u2013222. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13350-8_16"},{"issue":"11\u201312","key":"21_CR11","first-page":"1027","volume":"17","author":"A Say","year":"2017","unstructured":"Say, A., Yakaryilmaz, A.: Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17(11\u201312), 1027\u20131043 (2017)","journal-title":"Quantum Inf. Comput."},{"issue":"4","key":"21_CR12","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129504004256","volume":"14","author":"P Selinger","year":"2004","unstructured":"Selinger, P.: Towards a quantum programming language. Math. Struct. Comput. Sci. 14(4), 527\u2013586 (2004)","journal-title":"Math. Struct. Comput. Sci."},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1017\/S0960129506005238","volume":"16","author":"P Selinger","year":"2006","unstructured":"Selinger, P., Valiron, B.: A lambda calculus for quantum computation with classical control. Math. Struct. Comput. Sci. 16(3), 527\u2013552 (2006)","journal-title":"Math. Struct. Comput. Sci."},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-319-13749-0_13","volume-title":"Theory and Practice of Natural Computing","author":"M Villagra","year":"2014","unstructured":"Villagra, M., Yamakami, T.: Quantum and reversible verification of proofs using constant memory space. In: Dediu, A.-H., Lozano, M., Mart\u00edn-Vide, C. (eds.) TPNC 2014. LNCS, vol. 8890, pp. 144\u2013156. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-13749-0_13"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-319-19225-3_24","volume-title":"Descriptional Complexity of Formal Systems","author":"M Villagra","year":"2015","unstructured":"Villagra, M., Yamakami, T.: Quantum state complexity of formal languages. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 280\u2013291. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_24"},{"key":"21_CR16","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.ic.2014.10.003","volume":"239","author":"T Yamakami","year":"2014","unstructured":"Yamakami, T.: One-way reversible and quantum finite automata with advice. Inf. Comput. 239, 122\u2013148 (2014)","journal-title":"Inf. Comput."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.ic.2015.02.003","volume":"241","author":"S Zheng","year":"2015","unstructured":"Zheng, S., Qiu, D., Gruska, J.: Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata. Inf. Comput. 241, 197\u2013214 (2015)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Theory and Practice of Natural Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04070-3_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T04:29:47Z","timestamp":1775276987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-04070-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030040697","9783030040703"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04070-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TPNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Practice of Natural Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tpnc2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/tpnc2018.irdta.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}