{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:03:21Z","timestamp":1742972601803,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030853143"},{"type":"electronic","value":"9783030853150"}],"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-85315-0_17","type":"book-chapter","created":{"date-parts":[[2021,8,19]],"date-time":"2021-08-19T12:05:42Z","timestamp":1629374742000},"page":"295-313","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning Probabilistic Automata Using Residuals"],"prefix":"10.1007","author":[{"given":"Wenjing","family":"Chu","sequence":"first","affiliation":[]},{"given":"Shuo","family":"Chen","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3746-3618","authenticated-orcid":false,"given":"Marcello","family":"Bonsangue","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,8,20]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1109\/89.221369","volume":"1","author":"LR Bahl","year":"1993","unstructured":"Bahl, L.R., Brown, P.F., de Souza, P.V., Mercer, R.L.: Estimating hidden Markov model parameters so as to maximize speech recognition accuracy. IEEE Trans. Speech Audio Process. 1(1), 77\u201383 (1993)","journal-title":"IEEE Trans. Speech Audio Process."},{"key":"17_CR2","volume-title":"Bioinformatics: The Machine Learning Approach","author":"P Baldi","year":"2001","unstructured":"Baldi, P., Brunak, S., Bach, F.: Bioinformatics: The Machine Learning Approach. MIT Press, Cambridge (2001)"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1214\/aoms\/1177697196","volume":"41","author":"LE Baum","year":"1970","unstructured":"Baum, L.E., Petrie, T., Soules, G., Weiss, N.: A maximization technique occurring in the statistical analysis of probabilistic functions of Markov chains. Ann. Math. Stat. 41(1), 164\u2013171 (1970)","journal-title":"Ann. Math. Stat."},{"key":"17_CR4","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":"17_CR5","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"},{"issue":"04","key":"17_CR6","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1142\/S0129054107004966","volume":"18","author":"C Cortes","year":"2007","unstructured":"Cortes, C., Mohri, M., Rastogi, A.: LP distance and equivalence of probabilistic automata. Int. J. Found. Comput. Sci. 18(04), 761\u2013779 (2007)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1023\/A:1007353007695","volume":"27","author":"C De La Higuera","year":"1997","unstructured":"De La Higuera, C.: Characteristic sets for polynomial grammatical inference. Mach. Learn. 27(2), 125\u2013138 (1997)","journal-title":"Mach. Learn."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/978-3-540-39624-6_20","volume-title":"Algorithmic Learning Theory","author":"C De La Higuera","year":"2003","unstructured":"De La Higuera, C., Oncina, J.: Identification with probability one of stochastic deterministic linear languages. In: Gavald\u00e1, R., Jantke, K.P., Takimoto, E. (eds.) ALT 2003. LNCS (LNAI), vol. 2842, pp. 247\u2013258. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-3-540-39624-6_20"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1007\/3-540-45583-3_26","volume-title":"Algorithmic Learning Theory","author":"F Denis","year":"2001","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Learning regular languages using RFSA. In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS, vol. 2225, pp. 348\u2013363. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45583-3_26"},{"issue":"4","key":"17_CR10","first-page":"339","volume":"51","author":"F Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform. 51(4), 339\u2013368 (2002)","journal-title":"Fund. Inform."},{"key":"17_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/3-540-45790-9_6","volume-title":"Grammatical Inference: Algorithms and Applications","author":"F Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Some classes of regular languages identifiable in the limit from positive data. In: Adriaans, P., Fernau, H., van Zaanen, M. (eds.) ICGI 2002. LNCS (LNAI), vol. 2484, pp. 63\u201376. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45790-9_6"},{"issue":"9","key":"17_CR12","doi-asserted-by":"publisher","first-page":"1349","DOI":"10.1016\/j.patcog.2004.03.020","volume":"38","author":"P Dupont","year":"2005","unstructured":"Dupont, P., Denis, F., Esposito, Y.: Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms. Pattern Recogn. 38(9), 1349\u20131371 (2005)","journal-title":"Pattern Recogn."},{"key":"17_CR13","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":"17_CR14","volume-title":"Statistical Methods for Speech Recognition","author":"F Jelinek","year":"1997","unstructured":"Jelinek, F.: Statistical Methods for Speech Recognition. MIT Press, Cambridge (1997)"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Lee, K.F.: Large-vocabulary speaker-independent continuous speech recognition: the SPHINX system. Carnegie Mellon University (1988)","DOI":"10.1016\/0167-6393(88)90053-2"},{"issue":"3","key":"17_CR16","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1016\/S0022-0000(02)00009-0","volume":"65","author":"RB Lyngs\u00f8","year":"2002","unstructured":"Lyngs\u00f8, R.B., Pedersen, C.N.: The consensus string problem and the complexity of comparing hidden Markov models. J. Comput. Syst. Sci. 65(3), 545\u2013569 (2002)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR17","volume-title":"Introduction to Languages and the Theory of Computation","author":"JC Martin","year":"1991","unstructured":"Martin, J.C.: Introduction to Languages and the Theory of Computation, vol. 4. McGraw-Hill, New York (1991)"},{"issue":"3","key":"17_CR18","first-page":"321","volume":"7","author":"M Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb. 7(3), 321\u2013350 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-319-11164-3_28","volume-title":"Runtime Verification","author":"A Nouri","year":"2014","unstructured":"Nouri, A., Raman, B., Bozga, M., Legay, A., Bensalem, S.: Faster statistical model checking by means of abstraction and learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 340\u2013355. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_28"},{"key":"17_CR20","unstructured":"Seymore, K., McCallum, A., Rosenfeld, R., et al.: Learning hidden Markov model structure for information extraction. In: AAAI-99 Workshop on Machine Learning for Information Extraction, pp. 37\u201342 (1999)"},{"issue":"4","key":"17_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ipm.2009.03.002","volume":"45","author":"M Sokolova","year":"2009","unstructured":"Sokolova, M., Lapalme, G.: A systematic analysis of performance measures for classification tasks. Inf. Process. Manage. 45(4), 427\u2013437 (2009)","journal-title":"Inf. Process. Manage."},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Tappler, M., Aichernig, B.K., Bacci, G., Eichlseder, M., Larsen, K.G.: L*-based learning of Markov decision processes (extended version). arXiv preprint arXiv:1906.12239 (2019)","DOI":"10.1007\/978-3-030-30942-8_38"},{"key":"17_CR23","unstructured":"Thollard, F., Dupont, P., De La Higuera, C., et al.: Probabilistic DFA inference using Kullback-Leibler divergence and minimality. In: ICML, pp. 975\u2013982 (2000)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2021"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-85315-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T16:47:32Z","timestamp":1673110052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85315-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030853143","9783030853150"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85315-0_17","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":"20 August 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","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":"6 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 September 2021","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":"ictac2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2021.github.io\/","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":"55","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":"20","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":"36% - 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)"}}]}}