{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:47:11Z","timestamp":1743119231717,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031352560"},{"type":"electronic","value":"9783031352577"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-35257-7_16","type":"book-chapter","created":{"date-parts":[[2023,6,26]],"date-time":"2023-06-26T23:02:32Z","timestamp":1687820552000},"page":"268-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximately Learning Quantum Automata"],"prefix":"10.1007","author":[{"given":"Wenjing","family":"Chu","sequence":"first","affiliation":[]},{"given":"Shuo","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]},{"given":"Zenglin","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,27]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0019-9958(78)90683-6","volume":"39","author":"D Angluin","year":"1978","unstructured":"Angluin, D.: On the complexity of minimum inference of regular sets. Inf. Control 39(3), 337\u2013350 (1978)","journal-title":"Inf. Control"},{"issue":"2","key":"16_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"16_CR3","unstructured":"Angluin, D.: Identifying languages from stochastic examples. Yale University, Department of Computer Science (1988)"},{"issue":"3","key":"16_CR4","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D Angluin","year":"1983","unstructured":"Angluin, D., Smith, C.H.: Inductive inference: theory and methods. ACM Comput. Surv. (CSUR) 15(3), 237\u2013269 (1983)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"16_CR5","unstructured":"Arunachalam, S., De Wolf, R.: Optimal quantum sample complexity of learning algorithms. J. Mach. Learn. Res. 19(1), 2879\u20132878 (2018)"},{"issue":"2","key":"16_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1145\/3106700.3106710","volume":"48","author":"S Arunachalam","year":"2017","unstructured":"Arunachalam, S., de Wolf, R.: Guest column: a survey of quantum learning theory. ACM SIGACT News 48(2), 41\u201367 (2017)","journal-title":"ACM SIGACT News"},{"issue":"6","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1268","DOI":"10.1137\/S009753979326091X","volume":"25","author":"F Bergadano","year":"1996","unstructured":"Bergadano, F., Varricchio, S.: Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25(6), 1268\u20131280 (1996)","journal-title":"SIAM J. Comput."},{"issue":"1\u20132","key":"16_CR8","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0304-3975(00)00154-7","volume":"262","author":"A Bertoni","year":"2001","unstructured":"Bertoni, A., Carpentieri, M.: Analogies and differences between quantum and stochastic automata. Theor. Comput. Sci. 262(1\u20132), 69\u201381 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR9","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: IJCAI. vol. 9, pp. 1004\u20131009 (2009)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Bshouty, N.H., Jackson, J.C.: Learning DNF over the uniform distribution using a quantum example oracle. In: Proceedings of the Eighth Annual Conference on Computational Learning Theory, pp. 118\u2013127 (1995)","DOI":"10.1145\/225298.225312"},{"key":"16_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"RC Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS, vol. 862, pp. 139\u2013152. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_144"},{"key":"16_CR12","unstructured":"Chalupar, G., Peherstorfer, S., Poll, E., De Ruiter, J.: Automated reverse engineering using $$\\{$$Lego\u00ae$$\\}$$. In: 8th USENIX Workshop on Offensive Technologies (WOOT 14) (2014)"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-319-24953-7_9","volume-title":"Automated Technology for Verification and Analysis","author":"M Chapman","year":"2015","unstructured":"Chapman, M., Chockler, H., Kesseli, P., Kroening, D., Strichman, O., Tautschnig, M.: Learning the language of error. In: Finkbeiner, B., Pu, G., Zhang, L. (eds.) ATVA 2015. LNCS, vol. 9364, pp. 114\u2013130. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24953-7_9"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Cho, C.Y., Babi \u0107, D., Shin, E.C.R., Song, D.: Inference and analysis of formal models of botnet command and control protocols. In: Proceedings of the 17th ACM Conference on Computer and Communications Security, pp. 426\u2013439 (2010)","DOI":"10.1145\/1866307.1866355"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Chu, W., Bonsangue, M.: Learning probabilistic languages by k-testable machines. In: 2020 International Symposium on Theoretical Aspects of Software Engineering (TASE), pp. 129\u2013136. IEEE (2020)","DOI":"10.1109\/TASE49443.2020.00026"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Chu, W., Chen, S., Bonsangue, M.: Non-linear optimization methods for learning regular distributions. In: Riesco, A., Zhang, M. (eds.) Formal Methods and Software Engineering. ICFEM 2022. LNCS, vol. 13478, pp. 54\u201370. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17244-1_4","DOI":"10.1007\/978-3-031-17244-1_4"},{"key":"16_CR17","unstructured":"De Ruiter, J., Poll, E.: Protocol state fuzzing of $$\\{$$TLS$$\\}$$ implementations. In: 24th USENIX Security Symposium (USENIX Security 2015), pp. 193\u2013206 (2015)"},{"key":"16_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-45790-9_7","volume-title":"Grammatical Inference: Algorithms and Applications","author":"Y Esposito","year":"2002","unstructured":"Esposito, Y., Lemay, A., Denis, F., Dupont, P.: Learning probabilistic residual finite state automata. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 77\u201391. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45790-9_7"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-319-41540-6_25","volume-title":"Computer Aided Verification","author":"P Fiter\u0103u-Bro\u015ftean","year":"2016","unstructured":"Fiter\u0103u-Bro\u015ftean, P., Janssen, R., Vaandrager, F.: Combining model learning and model checking to analyze TCP implementations. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9780, pp. 454\u2013471. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41540-6_25"},{"key":"16_CR20","unstructured":"Garcia, P., Vidal, E., Oncina, J.: Learning locally testable languages in the strict sense. In: ALT, pp. 325\u2013338 (1990)"},{"issue":"5","key":"16_CR21","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967)","journal-title":"Inf. Control"},{"issue":"3","key":"16_CR22","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Inf. Control 37(3), 302\u2013320 (1978)","journal-title":"Inf. Control"},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Grefenstette, J.J.: Genetic algorithms and machine learning. In: Proceedings of the Sixth Annual Conference on Computational Learning Theory, pp. 3\u20134 (1993)","DOI":"10.1145\/168304.168305"},{"issue":"03","key":"16_CR24","doi-asserted-by":"publisher","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(03), 381\u2013398 (2015)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR25","unstructured":"Hansen, N.: The CMA evolution strategy: a tutorial. arXiv preprint arXiv:1604.00772 (2016)"},{"issue":"1","key":"16_CR26","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1038\/scientificamerican0792-66","volume":"267","author":"JH Holland","year":"1992","unstructured":"Holland, J.H.: Genetic algorithms. Sci. Am. 267(1), 66\u201373 (1992)","journal-title":"Sci. Am."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 66\u201375. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"16_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/3-540-45678-3_24","volume-title":"Algorithms and Computation","author":"T Koshiba","year":"2001","unstructured":"Koshiba, T.: Polynomial-time algorithms for the equivalence for one-way quantum finite automata. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 268\u2013278. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45678-3_24"},{"issue":"3","key":"16_CR29","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1016\/j.jcss.2012.01.004","volume":"78","author":"T Lin","year":"2012","unstructured":"Lin, T.: Another approach to the equivalence of measure-many one-way quantum finite automata and its application. J. Comput. Syst. Sci. 78(3), 807\u2013821 (2012)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"16_CR30","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."},{"key":"16_CR31","doi-asserted-by":"crossref","unstructured":"de Nobel, J., Vermetten, D., Wang, H., Doerr, C., B\u00e4ck, T.: Tuning as a means of assessing the benefits of new ideas in interplay with existing algorithmic modules. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1375\u20131384 (2021)","DOI":"10.1145\/3449726.3463167"},{"key":"16_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0054062","volume-title":"Grammatical Inference","author":"R Parekh","year":"1998","unstructured":"Parekh, R., Nichitiu, C., Honavar, V.: A polynomial time incremental algorithm for learning DFA. In: Honavar, V., Slutzki, G. (eds.) ICGI 1998. LNCS, vol. 1433, pp. 37\u201349. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054062"},{"key":"16_CR33","unstructured":"Qiu, D.: Learning quantum finite automata with queries. arXiv preprint arXiv:2111.14041 (2021)"},{"issue":"4","key":"16_CR34","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/BF01449770","volume":"63","author":"E Schmidt","year":"1907","unstructured":"Schmidt, E.: Zur theorie der linearen und nichtlinearen integralgleichungen. Math. Ann. 63(4), 433\u2013476 (1907)","journal-title":"Math. Ann."},{"issue":"11","key":"16_CR35","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"issue":"3","key":"16_CR36","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/S0019-9958(74)91369-2","volume":"26","author":"RM Wharton","year":"1974","unstructured":"Wharton, R.M.: Approximate language identification. Inf. Control 26(3), 236\u2013255 (1974)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-35257-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T03:24:07Z","timestamp":1729653847000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-35257-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031352560","9783031352577"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-35257-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Theoretical Aspects of Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bristol","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tase2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/bristolpl.github.io\/tase2023\/","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":"49","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":"2","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":"39% - 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","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":"3","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)"}}]}}