{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:05:09Z","timestamp":1767236709228,"version":"3.40.3"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030879921"},{"type":"electronic","value":"9783030879938"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-87993-8_6","type":"book-chapter","created":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T05:22:02Z","timestamp":1633929722000},"page":"84-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Affine Automata Verifiers"],"prefix":"10.1007","author":[{"given":"Aliya","family":"Khadieva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2372-252X","authenticated-orcid":false,"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,11]]},"reference":[{"issue":"1","key":"6_CR1","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."},{"key":"6_CR2","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata: from mathematics to applications. Technical Report. arXiv:1507.01988 (2015). to appear in Automata and Quantum Computing edited by Jean-\u00c8ric Pin"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: STOC 1985, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-08860-1_6","volume-title":"Automata, Languages and Programming","author":"P Berman","year":"1978","unstructured":"Berman, P.: Relationship between density and deterministic complexity of MP-complete languages. In: Ausiello, G., B\u00f6hm, C. (eds.) ICALP 1978. LNCS, vol. 62, pp. 63\u201371. Springer, Heidelberg (1978). https:\/\/doi.org\/10.1007\/3-540-08860-1_6"},{"key":"6_CR5","unstructured":"Condon, A.: The complexity of space bounded interactive proof systems. In: Complexity Theory: Current Research, pp. 147\u2013190. Cambridge University Press, Cambridge (1993)"},{"issue":"3","key":"6_CR6","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/S0097539794265578","volume":"27","author":"A Condon","year":"1998","unstructured":"Condon, A., Hellerstein, L., Pottle, S., Wigderson, A.: On the power of finite automata with both nondeterministic and probabilistic states. SIAM J. Comput. 27(3), 739\u2013762 (1998)","journal-title":"SIAM J. Comput."},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"D\u00edaz-Caro, A., Yakary\u0131lmaz, A.: Affine computation and affine automaton. In: Kulikov, A.S., Woeginger, G.J. (eds.) CSR 2016. LNCS, vol. 9691, pp. 146\u2013160. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-34171-2_11, arXiv:1602.04732","DOI":"10.1007\/978-3-319-34171-2_11"},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"1011","DOI":"10.1137\/0219069","volume":"19","author":"C Dwork","year":"1990","unstructured":"Dwork, C., Stockmeyer, L.: A time complexity gap for two-way probabilistic finite-state automata. SIAM J. Comput. 19(6), 1011\u20131123 (1990)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers $$\\text{ I }$$: the power of interaction. J. ACM 39(4), 800\u2013828 (1992)","journal-title":"J. ACM"},{"key":"6_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/3-540-10856-4_72","volume-title":"Mathematical Foundations of Computer Science 1981","author":"R Freivalds","year":"1981","unstructured":"Freivalds, R.: Probabilistic two-way machines. In: Gruska, J., Chytil, M. (eds.) MFCS 1981. LNCS, vol. 118, pp. 33\u201345. Springer, Heidelberg (1981). https:\/\/doi.org\/10.1007\/3-540-10856-4_72"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1007\/3-540-58201-0_100","volume-title":"Automata, Languages and Programming","author":"R Freivalds","year":"1994","unstructured":"Freivalds, R., Karpinski, M.: Lower space bounds for randomized computation. In: Abiteboul, S., Shamir, E. (eds.) ICALP 1994. LNCS, vol. 820, pp. 580\u2013592. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58201-0_100"},{"issue":"1","key":"6_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"6_CR13","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1016\/0022-0000(86)90045-0","volume":"33","author":"AG Greenberg","year":"1986","unstructured":"Greenberg, A.G., Weiss, A.: A lower bound for probabilistic algorithms for finite state machines. J. Comput. Syst. Sci. 33(1), 88\u2013105 (1986)","journal-title":"J. Comput. Syst. Sci."},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-319-53733-7_30","volume-title":"Language and Automata Theory and Applications","author":"M Hirvensalo","year":"2017","unstructured":"Hirvensalo, M., Moutot, E., Yakary\u0131lmaz, A.: On the computational power of affine automata. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 405\u2013417. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_30"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-030-19311-9_10","volume-title":"Unconventional Computation and Natural Computation","author":"M Hirvensalo","year":"2019","unstructured":"Hirvensalo, M., Moutot, E., Yakary\u0131lmaz, A.: Computational limitations of affine automata. In: McQuillan, I., Seki, S. (eds.) UCNC 2019. LNCS, vol. 11493, pp. 108\u2013121. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19311-9_10"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11047-020-09815-1","volume":"46","author":"M Hirvensalo","year":"2021","unstructured":"Hirvensalo, M., Moutot, E., Yakary\u0131lmaz, A.: Computational limitations of affine automata and generalized affine automata. Nat. Comput. 46, 1\u201312 (2021). https:\/\/doi.org\/10.1007\/s11047-020-09815-1","journal-title":"Nat. Comput."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Ibrahimov, R., Khadiev, K., Pr\u016bsis, K., Yakary\u0131lmaz, A.: Error-free affine, unitary, and probabilistic OBDDs. Int. J. Found. Comput. Sci. https:\/\/doi.org\/10.1142\/S0129054121500246","DOI":"10.1142\/S0129054121500246"},{"key":"6_CR18","doi-asserted-by":"publisher","unstructured":"Ibrahimov, R., Khadiev, K., Pr\u016bsis, K., Yakary\u0131lmaz, A.: Error-free affine, unitary, and probabilistic OBDDs. In: Konstantinidis, S., Pighizzini, G. (eds.) DCFS 2018. LNCS, vol. 10952, pp. 175\u2013187. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94631-3_15, arXiv:1703.07184","DOI":"10.1007\/978-3-319-94631-3_15"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/3-540-54458-5_73","volume-title":"Fundamentals of Computation Theory","author":"J Ka\u0146eps","year":"1991","unstructured":"Ka\u0146eps, J.: Regularity of one-letter languages acceptable by 2-way finite probabilistic automata. In: Budach, L. (ed.) FCT 1991. LNCS, vol. 529, pp. 287\u2013296. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54458-5_73"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Khadieva, A., Yakary\u0131lmaz, A.: Affine automata verifiers. Technical Report. arXiv:2104.11192 (2021)","DOI":"10.1007\/978-3-030-87993-8_6"},{"key":"6_CR21","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, \u00c9.: Algorithm Design. Pearson\/Addison-Wesley, Boston (2006)"},{"key":"6_CR22","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66\u201375 (1997)"},{"key":"6_CR23","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.tcs.2011.10.021","volume":"419","author":"L Li","year":"2012","unstructured":"Li, L., Qiu, D., Zou, X., Li, L., Wu, L., Mateus, P.: Characterizations of one-way general quantum finite automata. Theor. Comput. Sci. 419, 73\u201391 (2012)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Nakanishi, M., Khadiev, K., Pr\u016bsis, K., Vihrovs, J., Yakary\u0131lmaz, A.: Exact affine counter automata. In: 15th International Conference on Automata and Formal Languages. EPTCS, vol. 252, pp. 205\u2013218 (2017). arXiv:1703.04281","DOI":"10.4204\/EPTCS.252.20"},{"issue":"4","key":"6_CR25","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":"6_CR26","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"MO Rabin","year":"1963","unstructured":"Rabin, M.O.: Probabilistic automata. Inf. Control 6, 230\u2013243 (1963)","journal-title":"Inf. Control"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Remscrim, Z.: Lower bounds on the running time of two-way quantum finite automata and sublogarithmic-space quantum turing machines. In: 12th Innovations in Theoretical Computer Science Conference. LIPIcs, vol. 185, pp. 39:1\u201339:20 (2021). https:\/\/doi.org\/10.4230\/LIPIcs.ITCS.2021.39","DOI":"10.4230\/LIPIcs.ITCS.2021.39"},{"key":"6_CR28","doi-asserted-by":"crossref","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Finite state verifiers with constant randomness. Logical Methods Comput. Sci. 10(3) (2014)","DOI":"10.2168\/LMCS-10(3:6)2014"},{"issue":"11&12","key":"6_CR29","first-page":"1027","volume":"17","author":"ACC Say","year":"2017","unstructured":"Say, A.C.C., Yakary\u0131lmaz, A.: Magic coins are useful for small-space quantum machines. Quantum Inf. Comput. 17(11 & 12), 1027\u20131043 (2017)","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"6_CR30","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(81)90033-5","volume":"24","author":"P Turakainen","year":"1981","unstructured":"Turakainen, P.: On nonstochastic languages and homomorphic images of stochastic languages. Inf. Sci. 24(3), 229\u2013253 (1981)","journal-title":"Inf. Sci."},{"key":"6_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1007\/978-3-319-41312-9_10","volume-title":"Unconventional Computation and Natural Computation","author":"M Villagra","year":"2016","unstructured":"Villagra, M., Yakary\u0131lmaz, A.: Language recognition power and succinctness of affine automata. In: Amos, M., Condon, A. (eds.) UCNC 2016. LNCS, vol. 9726, pp. 116\u2013129. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41312-9_10"},{"issue":"2","key":"6_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s11047-017-9652-z","volume":"17","author":"M Villagra","year":"2017","unstructured":"Villagra, M., Yakary\u0131lmaz, A.: Language recognition power and succinctness of affine automata. Nat. Comput. 17(2), 283\u2013293 (2017). https:\/\/doi.org\/10.1007\/s11047-017-9652-z","journal-title":"Nat. Comput."},{"key":"6_CR33","unstructured":"Yakary\u0131lmaz, A.: Public qubits versus private coins. In: The Proceedings of Workshop on Quantum and Classical Complexity, pp. 45\u201360. University of Latvia Press (2013). eCCC:TR12-130"},{"key":"6_CR34","doi-asserted-by":"crossref","unstructured":"Yakary\u0131lmaz, A.: Improved constructions for succinct affine automata. Technical Report. arXiv:2106.16197 (2021)","DOI":"10.1007\/978-3-030-93489-7_16"},{"key":"6_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-03351-3_33","volume-title":"Computer Science - Theory and Applications","author":"A Yakaryilmaz","year":"2009","unstructured":"Yakaryilmaz, A., Say, A.C.C.: Languages recognized with unbounded error by quantum finite automata. In: Frid, A., Morozov, A., Rybalchenko, A., Wagner, K.W. (eds.) CSR 2009. LNCS, vol. 5675, pp. 356\u2013367. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03351-3_33"},{"issue":"9&10","key":"6_CR36","first-page":"747","volume":"10","author":"A Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10(9 & 10), 747\u2013770 (2010)","journal-title":"Quantum Inf. Comput."},{"issue":"2","key":"6_CR37","first-page":"19","volume":"12","author":"A Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Succinctness of two-way probabilistic and quantum finite automata. Discrete Math. Theor. Comput. Sci. 12(2), 19\u201340 (2010)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"6","key":"6_CR38","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ic.2011.01.008","volume":"279","author":"A Yakary\u0131lmaz","year":"2011","unstructured":"Yakary\u0131lmaz, A., Say, A.C.C.: Unbounded-error quantum computation with small space bounds. Inf. Comput. 279(6), 873\u2013892 (2011)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-87993-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,11]],"date-time":"2023-01-11T18:05:55Z","timestamp":1673460355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-87993-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030879921","9783030879938"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-87993-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"11 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"UCNC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Unconventional Computation and Natural Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Espoo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Finland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ucnc2021.cs.aalto.fi\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}