{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:11:05Z","timestamp":1767237065092},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319413112"},{"type":"electronic","value":"9783319413129"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-41312-9_10","type":"book-chapter","created":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T01:16:35Z","timestamp":1465866995000},"page":"116-129","source":"Crossref","is-referenced-by-count":10,"title":["Language Recognition Power and Succinctness of Affine Automata"],"prefix":"10.1007","author":[{"given":"Marcos","family":"Villagra","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abuzer","family":"Yakary\u0131lmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,15]]},"reference":[{"key":"10_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/978-3-319-09704-6_6","volume-title":"Descriptional Complexity of Formal Systems","author":"F Ablayev","year":"2014","unstructured":"Ablayev, F., Gainutdinova, A., Khadiev, K., Yakary\u0131lmaz, A.: Very narrow quantum OBDDs and width hierarchies for classical OBDDs. In: J\u00fcrgensen, H., Karhum\u00e4ki, J., Okhotin, A. (eds.) DCFS 2014. LNCS, vol. 8614, pp. 53\u201364. Springer, Heidelberg (2014)"},{"key":"10_CR2","unstructured":"Ambainis, A., Freivalds, R.: 1-way quantum finite automata: strengths, weaknesses and generalizations. In: FOCS 1998, pp. 332\u2013341 (1998). arXiv:9802062"},{"issue":"7","key":"10_CR3","doi-asserted-by":"crossref","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":"10_CR4","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing. Technical report 1507.01988, arXiv (2015)"},{"key":"10_CR5","unstructured":"Belovs, A., Montoya, J.A., Yakary\u0131lmaz, A.: Can one quantum bit separate any pair of words with zero-error? Technical report 1602.07967, arXiv (2016)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-319-34171-2_11","volume-title":"Computer Science \u2013 Theory and Applications","author":"A D\u00edaz-Caro","year":"2016","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, Heidelberg (2016). doi: 10.1007\/978-3-319-34171-2_11"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Freivalds, R., Karpinski, M.: Lower space bounds for randomized computation. In: ICALP 1994, pp. 580\u2013592 (1994)","DOI":"10.1007\/3-540-58201-0_100"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-319-21500-6_20","volume-title":"Developments in Language Theory","author":"A Gainutdinova","year":"2015","unstructured":"Gainutdinova, A., Yakary\u0131lmaz, A.: Unary probabilistic and quantum automata on promise problems. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 252\u2013263. Springer, Heidelberg (2015)"},{"issue":"2","key":"10_CR9","first-page":"157","volume":"17","author":"V Geffert","year":"2015","unstructured":"Geffert, V., Yakary\u0131lmaz, A.: Classical automata on promise problems. Discrete Math. Theor. Comput. Sci. 17(2), 157\u2013180 (2015)","journal-title":"Discrete Math. Theor. Comput. Sci."},{"issue":"3","key":"10_CR10","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1142\/S0129054115500215","volume":"26","author":"J Gruska","year":"2015","unstructured":"Gruska, J., Qiu, D., Zheng, S.: Potential of quantum finite automata with exact acceptance. Int. J. Found. Comput. Sci. 26(3), 381\u2013398 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10_CR11","unstructured":"Kupferman, O., Ta-Shma, A., Vardi, M.Y.: Counting with automata. Short paper presented at the 15th Annual IEEE Symposium on Logic in Computer Science (LICS 2000) (1999)"},{"key":"10_CR12","doi-asserted-by":"crossref","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."},{"issue":"2","key":"10_CR13","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/S0097539793253851","volume":"27","author":"II Macarie","year":"1998","unstructured":"Macarie, I.I.: Space-efficient deterministic simulation of probabilistic automata. SIAM J. Comput. 27(2), 448\u2013465 (1998)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"10_CR14","doi-asserted-by":"crossref","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."},{"key":"10_CR15","volume-title":"Introduction to Probabilistic Automata","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata. Academic Press, New York (1971)"},{"key":"10_CR16","doi-asserted-by":"crossref","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":"10_CR17","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M Rabin","year":"1959","unstructured":"Rabin, M., Scott, D.: Finite automata and their decision problems. IBM J. Res. Dev. 3, 114\u2013125 (1959)","journal-title":"IBM J. Res. Dev."},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/978-3-319-08846-4_24","volume-title":"Implementation and Application of Automata","author":"J Rashid","year":"2014","unstructured":"Rashid, J., Yakary\u0131lmaz, A.: Implications of quantum automata for contextuality. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 318\u2013331. Springer, Heidelberg (2014)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","first-page":"208","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.) Gruska Festschrift. LNCS, vol. 8808, pp. 208\u2013222. Springer, Heidelberg (2014)"},{"issue":"1","key":"10_CR20","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s11047-015-9511-8","volume":"15","author":"AM Shur","year":"2016","unstructured":"Shur, A.M., Yakary\u0131lmaz, A.: More on quantum, stochastic, and pseudo stochastic languages with few states. Nat. Comput. 15(1), 129\u2013141 (2016)","journal-title":"Nat. Comput."},{"key":"10_CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.5186\/aasfm.1975.0126","volume":"1","author":"P Turakainenn","year":"1975","unstructured":"Turakainenn, P.: Word-functions of stochastic and pseudo stochastic automata. Ann. Acad. Scientiarum Fennicae, Ser. A. I Math. 1, 27\u201337 (1975)","journal-title":"Ann. Acad. Scientiarum Fennicae, Ser. A. I Math."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Villagra, M., Yakary\u0131lmaz, A.: Language recognition power and succintness of affine automata. Technical report 1602.05432, arXiv (2016)","DOI":"10.1007\/978-3-319-41312-9_10"},{"issue":"2","key":"10_CR23","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."},{"key":"10_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/978-3-642-03351-3_33","volume-title":"Computer Science - Theory and Applications","author":"A Yakary\u0131lmaz","year":"2009","unstructured":"Yakary\u0131lmaz, 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)"},{"issue":"9&10","key":"10_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. Quantum Inf. Comput. 10(9&10), 747\u2013770 (2010)","journal-title":"Quantum Inf. Comput."},{"issue":"6","key":"10_CR26","doi-asserted-by":"crossref","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":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-41312-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T18:03:35Z","timestamp":1568052215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-41312-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319413112","9783319413129"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-41312-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}