{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T03:12:43Z","timestamp":1767237163160,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030193102"},{"type":"electronic","value":"9783030193119"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-19311-9_10","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"108-121","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Computational Limitations of Affine Automata"],"prefix":"10.1007","author":[{"given":"Mika","family":"Hirvensalo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2073-4709","authenticated-orcid":false,"given":"Etienne","family":"Moutot","sequence":"additional","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":[[2019,4,26]]},"reference":[{"issue":"1","key":"10_CR1","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s00224-005-1263-x","volume":"39","author":"Andris Ambainis","year":"2005","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., K\u0327ikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic results on quantum automata. Theory Comput. Syst. 39(1), 165\u2013188 (2006)","journal-title":"Theory of Computing Systems"},{"key":"10_CR2","unstructured":"Ambainis, A., Yakary\u0131lmaz, A.: Automata and quantum computing. CoRR, abs\/1507.0:1\u201332 (2015)"},{"key":"10_CR3","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, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-34171-2_11"},{"issue":"2","key":"10_CR4","first-page":"225","volume":"53","author":"J-H Evertse","year":"1984","unstructured":"Evertse, J.-H.: On sums of S-units and linear recurrences. Compositio Math. 53(2), 225\u2013244 (1984)","journal-title":"Compositio Math."},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0304-3975(86)90168-4","volume":"43","author":"G Hansel","year":"1986","unstructured":"Hansel, G.: A simple proof of the Skolem-Mahler-Lech theorem. Theoret. Comput. Sci. 43(1), 91\u201398 (1986)","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-53733-7_30"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-319-94631-3_15","volume-title":"Descriptional Complexity of Formal Systems","author":"R Ibrahimov","year":"2018","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94631-3_15"},{"issue":"4","key":"10_CR8","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s00224-006-1314-y","volume":"40","author":"E Jeandel","year":"2007","unstructured":"Jeandel, E.: Topological automata. Theory Comput. Syst. 40(4), 397\u2013407 (2007)","journal-title":"Theory Comput. Syst."},{"key":"10_CR9","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: FOCS, pp. 66\u201375. IEEE (1997)"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","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":"9&10","key":"10_CR11","first-page":"747","volume":"10","author":"A Yakary\u0131lmaz","year":"2010","unstructured":"Yakary\u0131lmaz, A., Cem Say, A.C.: Languages recognized by nondeterministic quantum finite automata. Quantum Inf. Comput. 10(9&10), 747\u2013770 (2010)","journal-title":"Quantum Inf. Comput."},{"key":"10_CR12","volume-title":"Introduction to Probabilistic Automata (Computer Science and Applied Mathematics)","author":"A Paz","year":"1971","unstructured":"Paz, A.: Introduction to Probabilistic Automata (Computer Science and Applied Mathematics). Academic Press Inc., Orlando (1971)"},{"key":"10_CR13","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":"10_CR14","volume-title":"Introduction to the Theory of Computation","author":"M Sipser","year":"1996","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 1st edn. International Thomson Publishing, Stamford (1996)","edition":"1"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Turakainen, P.: On Probabilistic Automata and their Generalizations. Annales Academiae Scientiarum Fennicae. Series A 429 (1969)","DOI":"10.5186\/aasfm.1969.429"},{"issue":"2","key":"10_CR16","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(2), 303\u2013309 (1969)","journal-title":"Proc. Am. Math. Soc."},{"issue":"3","key":"10_CR17","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":"10_CR18","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). \n                    https:\/\/doi.org\/10.1007\/978-3-319-41312-9_10"}],"container-title":["Lecture Notes in Computer Science","Unconventional Computation and Natural Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19311-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,11]],"date-time":"2019-10-11T03:19:44Z","timestamp":1570763984000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19311-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030193102","9783030193119"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19311-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"26 April 2019","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":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"uc2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.ucnc2019.uec.ac.jp\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"59% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4 abstracts of invited talks and one full paper of an invited talk are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}