{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:08:39Z","timestamp":1767229719025,"version":"3.48.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030934880"},{"type":"electronic","value":"9783030934897"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93489-7_16","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:30:01Z","timestamp":1640997001000},"page":"188-199","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Constructions for\u00a0Succinct Affine Automata"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2372-252X","authenticated-orcid":false,"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,1,1]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS\u201998, pp. 332\u2013341. IEEE (1998)","DOI":"10.1109\/SFCS.1998.743469"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Ambainis, A.: The complexity of probabilistic versus deterministic finite automata. In: Asano, T., Igarashi, Y., Nagamochi, H., Miyano, S., Suri, S. (eds.) ISAAC 1996. LNCS, vol. 1178, pp. 233\u2013238. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0009499","DOI":"10.1007\/BFb0009499"},{"issue":"7","key":"16_CR3","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.ipl.2012.01.001","volume":"112","author":"A Ambainis","year":"2012","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Superiority of exact quantum automata for promise problems. Inf. Process. Lett. 112(7), 289\u2013291 (2012)","journal-title":"Inf. Process. Lett."},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing. In: \u00c9ric Pin, J. (ed.) Handbook of Automata Theory, vol. 2, chap. 39, pp. 1457\u20131493. European Mathematical Society Publishing House (2021)","DOI":"10.4171\/automata-2\/17"},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1142\/S0129054117400032","volume":"28","author":"A Belovs","year":"2017","unstructured":"Belovs, A., Montoya, J.A., Yakary\u0131lmaz, A.: On a conjecture by Christian Choffrut. Int. J. Found. Comput. Sci. 28(5), 483\u2013502 (2017)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR6","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","DOI":"10.1007\/978-3-319-34171-2_11"},{"issue":"2","key":"16_CR7","first-page":"157","volume":"17","author":"V Geffert","year":"2015","unstructured":"Geffert, V., Yakary\u0131lmaz, A.: Classical automata on promise problems. Discrete Math. Theoret. Comput. Sci. 17(2), 157\u2013180 (2015)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"1","key":"16_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s11047-017-9654-x","volume":"17","author":"M Hirvensalo","year":"2017","unstructured":"Hirvensalo, M.: Interference as a computational resource: a tutorial. Nat. Comput. 17(1), 201\u2013219 (2017). https:\/\/doi.org\/10.1007\/s11047-017-9654-x","journal-title":"Nat. Comput."},{"key":"16_CR9","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-319-53733-7_30"},{"key":"16_CR10","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-19311-9_10"},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Hirvensalo, M., Moutot, E., Yakary\u0131lmaz, A.: computational limitations of affine automata and generalized affine automata. Nat. Comput. 20(1), 1\u201312 (2021). https:\/\/doi.org\/10.1007\/s11047-020-09815-1","DOI":"10.1007\/s11047-020-09815-1"},{"key":"16_CR12","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","DOI":"10.1007\/978-3-319-94631-3_15"},{"key":"16_CR13","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054121500246","author":"R Ibrahimov","year":"2021","unstructured":"Ibrahimov, R., Khadiev, K., Pr\u016bsis, K., Yakary\u0131lmaz, A.: Error-free affine, unitary, and probabilistic OBDDs. Int. J. Found. Comput. Sci. (2021). https:\/\/doi.org\/10.1142\/S0129054121500246","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Khadieva, A., Yakary\u0131lmaz, A.: Affine automata verifiers. In: Kostitsyna, I., Orponen, P. (eds.) UCNC 2021. LNCS, vol. 12984, pp. 84\u2013100. Springer, Cham (2021)","DOI":"10.1007\/978-3-030-87993-8_6"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Klauck, H.: On quantum and probabilistic communication: Las Vegas and one-way protocols. In: STOC\u201900: Proceedings of the Thirty-Second Annual ACM Symposium on Theory of Computing, pp. 644\u2013651 (2000)","DOI":"10.1145\/335305.335396"},{"key":"16_CR16","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS 1997, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"16_CR17","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. Theoret. Comput. Sci. 419, 73\u201391 (2012)","journal-title":"Theoret. Comput. Sci."},{"key":"16_CR18","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"},{"key":"16_CR19","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"key":"16_CR20","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":"16_CR21","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"},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1090\/S0002-9939-1969-0242596-1","volume":"21","author":"P Turakainen","year":"1969","unstructured":"Turakainen, P.: Generalized automata and stochastic languages. Proc. Am. Math. Soc. 21, 303\u2013309 (1969)","journal-title":"Proc. Am. Math. Soc."},{"key":"16_CR23","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":"16_CR24","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."},{"issue":"9&10","key":"16_CR25","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. Quant. Inf. Comput. 10(9 & 10), 747\u2013770 (2010)","journal-title":"Quant. Inf. Comput."},{"issue":"2","key":"16_CR26","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. Theoret. Comput. Sci. 12(2), 19\u201340 (2010)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"6","key":"16_CR27","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","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93489-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T01:03:56Z","timestamp":1767229436000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93489-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030934880","9783030934897"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93489-7_16","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":"1 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/toc.yonsei.ac.kr\/dcfs2021\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}