{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T16:25:46Z","timestamp":1785428746175,"version":"3.56.0"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031453281","type":"print"},{"value":"9783031453298","type":"electronic"}],"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-45329-8_3","type":"book-chapter","created":{"date-parts":[[2023,10,21]],"date-time":"2023-10-21T18:02:40Z","timestamp":1697911360000},"page":"53-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Novel Family of\u00a0Finite Automata for\u00a0Recognizing and\u00a0Learning $$\\omega $$-Regular Languages"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7301-9234","authenticated-orcid":false,"given":"Yong","family":"Li","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9093-9518","authenticated-orcid":false,"given":"Sven","family":"Schewe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9265-3011","authenticated-orcid":false,"given":"Qiyi","family":"Tang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,10,22]]},"reference":[{"issue":"2","key":"3_CR1","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). https:\/\/doi.org\/10.1016\/0890-5401(87)90052-6","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR2","first-page":"1","volume":"14","author":"D Angluin","year":"2018","unstructured":"Angluin, D., Boker, U., Fisman, D.: Families of DFAs as acceptors of $$\\omega $$-regular languages. Log. Methods Comput. Sci. 14(1), 1\u201321 (2018)","journal-title":"Log. Methods Comput. Sci."},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2016.07.031","volume":"650","author":"D Angluin","year":"2016","unstructured":"Angluin, D., Fisman, D.: Learning regular omega languages. Theor. Comput. Sci. 650, 57\u201372 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.07.031","journal-title":"Theor. Comput. Sci."},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"104598","DOI":"10.1016\/j.ic.2020.104598","volume":"278","author":"D Angluin","year":"2021","unstructured":"Angluin, D., Fisman, D.: Regular $$\\omega $$-languages with an informative right congruence. Inf. Comput. 278, 104598 (2021). https:\/\/doi.org\/10.1016\/j.ic.2020.104598","journal-title":"Inf. Comput."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bohn, L., L\u00f6ding, C.: Passive learning of deterministic B\u00fcchi automata by combinations of DFAs. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, 4\u20138 July 2022, Paris, France. LIPIcs, vol. 229, pp. 114:1\u2013114:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2022.114","DOI":"10.4230\/LIPIcs.ICALP.2022.114"},{"key":"3_CR6","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: 1960 Proceedings of the International Congress on Logic, Method, and Philosophy of Science, pp. 1\u201312. Stanford University Press (1962)"},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/3-540-58027-1_27","volume-title":"Mathematical Foundations of Programming Semantics","author":"H Calbrix","year":"1994","unstructured":"Calbrix, H., Nivat, M., Podelski, A.: Ultimately periodic words of rational $$\\omega $$-languages. In: Brookes, S., Main, M., Melton, A., Mislove, M., Schmidt, D. (eds.) MFPS 1993. LNCS, vol. 802, pp. 554\u2013566. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58027-1_27"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-642-02930-1_13","volume-title":"Automata, Languages and Programming","author":"T Colcombet","year":"2009","unstructured":"Colcombet, T., Zdanowski, K.: A tight lower bound for determinization of transition labeled B\u00fcchi automata. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part II. LNCS, vol. 5556, pp. 151\u2013162. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02930-1_13"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-540-78800-3_2","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Farzan","year":"2008","unstructured":"Farzan, A., Chen, Y.-F., Clarke, E.M., Tsay, Y.-K., Wang, B.-Y.: Extending\u00a0automated\u00a0compositional\u00a0verification to the full class of omega-regular languages. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 2\u201317. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_2"},{"key":"3_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-58325-4_202","volume-title":"Algorithms and Computation","author":"SC Krishnan","year":"1994","unstructured":"Krishnan, S.C., Puri, A., Brayton, R.K.: Deterministic $$\\omega $$ automata vis-a-vis deterministic Buchi automata. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol. 834, pp. 378\u2013386. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58325-4_202"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0022-0000(87)90036-5","volume":"35","author":"RP Kurshan","year":"1987","unstructured":"Kurshan, R.P.: Complementing deterministic b\u00fcchi automata in polynomial time. J. Comput. Syst. Sci. 35(1), 59\u201371 (1987). https:\/\/doi.org\/10.1016\/0022-0000(87)90036-5","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"104678","DOI":"10.1016\/j.ic.2020.104678","volume":"281","author":"Y Li","year":"2021","unstructured":"Li, Y., Chen, Y., Zhang, L., Liu, D.: A novel learning algorithm for b\u00fcchi automata based on family of DFAs and classification trees. Inf. Comput. 281, 104678 (2021). https:\/\/doi.org\/10.1016\/j.ic.2020.104678","journal-title":"Inf. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Li, Y., Schewe, S., Tang, Q.: A novel family of finite automata for recognizing and learning $$\\omega $$-regular languages (2023)","DOI":"10.1007\/978-3-031-45329-8_3"},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/978-3-030-17462-0_23","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"Y Li","year":"2019","unstructured":"Li, Y., Sun, X., Turrini, A., Chen, Y.-F., Xu, J.: ROLL 1.0: $$\\omega $$-regular language learning library. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019, Part I. LNCS, vol. 11427, pp. 365\u2013371. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_23"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O Maler","year":"1995","unstructured":"Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. Inf. Comput. 118(2), 316\u2013326 (1995). https:\/\/doi.org\/10.1006\/inco.1995.1070","journal-title":"Inf. Comput."},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0304-3975(96)00312-X","volume":"183","author":"O Maler","year":"1997","unstructured":"Maler, O., Staiger, L.: On syntactic congruences for omega-languages. Theor. Comput. Sci. 183(1), 93\u2013112 (1997). https:\/\/doi.org\/10.1016\/S0304-3975(96)00312-X","journal-title":"Theor. Comput. Sci."},{"key":"3_CR17","unstructured":"Michel, M.: Complementation is more difficult with automata on infinite words. CNET, Paris 15 (1988)"},{"key":"3_CR18","unstructured":"Myhill, J.: Finite automata and the representation of events. In: Technical Report WADD TR-57-624, pp. 112\u2013137 (1957)"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automaton transformations. In: American Mathematical Society, pp. 541\u2013544 (1958)","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"issue":"12","key":"3_CR20","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"22","author":"CP Pfleeger","year":"1973","unstructured":"Pfleeger, C.P.: State reduction in incompletely specified finite-state machines. IEEE Trans. Comput. 22(12), 1099\u20131102 (1973). https:\/\/doi.org\/10.1109\/T-C.1973.223655","journal-title":"IEEE Trans. Comput."},{"key":"3_CR21","doi-asserted-by":"publisher","unstructured":"Safra, S.: On the complexity of omega-automata. In: 29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24\u201326 October 1988, pp. 319\u2013327. IEEE Computer Society (1988). https:\/\/doi.org\/10.1109\/SFCS.1988.21948","DOI":"10.1109\/SFCS.1988.21948"},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/978-3-642-00596-1_13","volume-title":"Foundations of Software Science and Computational Structures","author":"S Schewe","year":"2009","unstructured":"Schewe, S.: Tighter bounds for the determinisation of B\u00fcchi automata. In: de Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 167\u2013181. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00596-1_13"},{"key":"3_CR23","doi-asserted-by":"publisher","unstructured":"Schewe, S.: Beyond hyper-minimisation\u2014minimising dbas and DPAs is NP-complete. In: Lodaya, K., Mahajan, M. (eds.) IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2010, 15\u201318 December 2010, Chennai, India. LIPIcs, vol. 8, pp. 400\u2013411. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2010). https:\/\/doi.org\/10.4230\/LIPIcs.FSTTCS.2010.400","DOI":"10.4230\/LIPIcs.FSTTCS.2010.400"},{"key":"3_CR24","unstructured":"Vardi, M.Y., Wolper, P.: An automata-theoretic approach to automatic program verification (preliminary report). In: Proceedings of the Symposium on Logic in Computer Science (LICS 1986), Cambridge, Massachusetts, USA, 16\u201318 June 1986, pp. 332\u2013344. IEEE Computer Society (1986)"},{"key":"3_CR25","doi-asserted-by":"publisher","unstructured":"Wilke, T., Schewe, S.: $$\\omega $$-automata. In: Pin, J. (ed.) Handbook of Automata Theory, pp. 189\u2013234. European Mathematical Society Publishing House, Z\u00fcrich, Switzerland (2021). https:\/\/doi.org\/10.4171\/Automata-1\/6","DOI":"10.4171\/Automata-1\/6"}],"container-title":["Lecture Notes in Computer Science","Automated Technology for Verification and Analysis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-45329-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,24]],"date-time":"2023-12-24T15:05:15Z","timestamp":1703430315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-45329-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031453281","9783031453298"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-45329-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ATVA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Automated Technology for Verification and Analysis","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","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":"24 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"atva2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/atva-conference.org\/2023\/","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":"115","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":"30","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":"26% - 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.05","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":"9","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":"7 tool papers","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)"}}]}}