{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:26:08Z","timestamp":1742988368923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031132568"},{"type":"electronic","value":"9783031132575"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-13257-5_14","type":"book-chapter","created":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:02:52Z","timestamp":1661122972000},"page":"184-196","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Yet Another Canonical Nondeterministic Automaton"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Maarand","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hellis","family":"Tamm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,8,22]]},"reference":[{"issue":"2","key":"14_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":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/0020-0190(92)90198-5","volume":"43","author":"J Birget","year":"1992","unstructured":"Birget, J.: Intersection and union of regular languages and state complexity. Inf. Process. Lett. 43(4), 185\u2013190 (1992). https:\/\/doi.org\/10.1016\/0020-0190(92)90198-5","journal-title":"Inf. Process. Lett."},{"key":"14_CR3","unstructured":"Bollig, B., Habermehl, P., Kern, C., Leucker, M.: Angluin-style learning of NFA. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 1004\u20131009 (2009). http:\/\/ijcai.org\/Proceedings\/09\/Papers\/170.pdf"},{"key":"14_CR4","unstructured":"Brzozowski, J.A.: Canonical regular expressions and minimal state graphs for definite events. In: Proceedings of Symposium on Mathematical Theory of Automata. MRI Symposia Series, vol. 12, pp. 529\u2013561. Polytechnic Press, Polytechnic Institute of Brooklyn, N.Y. (1963)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.016","volume":"539","author":"JA Brzozowski","year":"2014","unstructured":"Brzozowski, J.A., Tamm, H.: Theory of \u00e1tomata. Theor. Comput. Sci. 539, 13\u201327 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR6","first-page":"339","volume":"51","author":"F Denis","year":"2002","unstructured":"Denis, F., Lemay, A., Terlutte, A.: Residual finite state automata. Fund. Inform. 51, 339\u2013368 (2002)","journal-title":"Fund. Inform."},{"issue":"5","key":"14_CR7","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1016\/j.ipl.2016.01.003","volume":"116","author":"S Iv\u00e1n","year":"2016","unstructured":"Iv\u00e1n, S.: Complexity of atoms, combinatorially. Inf. Process. Lett. 116(5), 356\u2013360 (2016)","journal-title":"Inf. Process. Lett."},{"issue":"7","key":"14_CR8","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1109\/T-C.1970.222994","volume":"19","author":"T Kameda","year":"1970","unstructured":"Kameda, T., Weiner, P.: On the state minimization of nondeterministic finite automata. IEEE Trans. Comput. 19(7), 617\u2013627 (1970)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR9","unstructured":"Lombardy, S., Sakarovitch, J.: The universal automaton. In: Flum, J., Gr\u00e4del, E., Wilke, T. (eds.) Logic and Automata: History and Perspectives [in Honor of Wolfgang Thomas]. Texts in Logic and Games, vol. 2, pp. 457\u2013504. Amsterdam University Press (2008)"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2015.03.035","volume":"604","author":"RSR Myers","year":"2015","unstructured":"Myers, R.S.R., Ad\u00e1mek, J., Milius, S., Urbat, H.: Coalgebraic constructions of canonical nondeterministic automata. Theor. Comput. Sci. 604, 81\u2013101 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A Nerode","year":"1958","unstructured":"Nerode, A.: Linear automaton transformations. Proc. Amer. Math. Soc. 9, 541\u2013544 (1958)","journal-title":"Proc. Amer. Math. Soc."},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-319-19225-3_23","volume-title":"Descriptional Complexity of Formal Systems","author":"H Tamm","year":"2015","unstructured":"Tamm, H.: Generalization of the double-reversal method of finding a canonical residual finite state automaton. In: Shallit, J., Okhotin, A. (eds.) DCFS 2015. LNCS, vol. 9118, pp. 268\u2013279. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19225-3_23"},{"key":"14_CR13","unstructured":"Tamm, H.: New interpretation and generalization of the Kameda-Weiner method. In: 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 55, pp. 116:1\u2013116:12. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl (2016)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-53733-7_19","volume-title":"Language and Automata Theory and Applications","author":"H Tamm","year":"2017","unstructured":"Tamm, H., van der Merwe, B.: Lower bound methods for the size of nondeterministic finite automata revisited. In: Drewes, F., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2017. LNCS, vol. 10168, pp. 261\u2013272. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53733-7_19"}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-13257-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,21]],"date-time":"2022-08-21T23:03:52Z","timestamp":1661123032000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-13257-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031132568","9783031132575"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-13257-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"22 August 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Debrecen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hungary","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/konferencia.unideb.hu\/en\/dcfs-2022","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":"17","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":"14","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":"82% - 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":"2.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)"}}]}}