{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:06:13Z","timestamp":1758636373927,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031521126"},{"type":"electronic","value":"9783031521133"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-52113-3_23","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"326-339","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Characteristic Factors of\u00a0a\u00a0Deterministic Finite Automaton and\u00a0Computing Its Positive Position Run by\u00a0Pattern Set Matching"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9329-1000","authenticated-orcid":false,"given":"Jan","family":"Janou\u0161ek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3783-8870","authenticated-orcid":false,"given":"\u0160t\u011bp\u00e1n","family":"Plach\u00fd","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Apostolico, A., Galil, Z. (eds.): Pattern Matching Algorithms. Oxford University Press, Oxford (1997). https:\/\/global.oup.com\/academic\/product\/pattern-matching-algorithms-9780195113679","DOI":"10.1093\/oso\/9780195113679.001.0001"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0037393","volume-title":"SOFSEM\u201996: Theory and Practice of Informatics","author":"R Baeza-Yates","year":"1996","unstructured":"Baeza-Yates, R.: A unified view to string matching algorithms. In: Jeffery, K.G., Kr\u00e1l, J., Barto\u0161ek, M. (eds.) SOFSEM 1996. LNCS, vol. 1175, pp. 1\u201315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0037393"},{"issue":"1","key":"23_CR3","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/S0304-3975(98)80011-X","volume":"205","author":"MP B\u00e9al","year":"1998","unstructured":"B\u00e9al, M.P., Senellart, J.: On the bound of the synchronization delay of a local automaton. Theoret. Comput. Sci. 205(1), 297\u2013306 (1998). https:\/\/doi.org\/10.1016\/S0304-3975(98)80011-X","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR4","unstructured":"B\u00e9al, M., Crochemore, M., Mignosi, F., Restivo, A., Sciortino, M.: Computing forbidden words of regular languages. Fundam. Informaticae 56(1\u20132), 121\u2013135 (2003). http:\/\/content.iospress.com\/articles\/fundamenta-informaticae\/fi56-1-2-08"},{"key":"23_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-031-40247-0_5","volume-title":"CIAA 2023","author":"V Bla\u017eej","year":"2023","unstructured":"Bla\u017eej, V., Janou\u0161ek, J., Plach\u00fd, \u0160: On the smallest synchronizing terms of finite tree automata. In: Nagy, B. (ed.) CIAA 2023. LNCS, vol. 14151, pp. 79\u201390. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-40247-0_5"},{"issue":"1","key":"23_CR6","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0304-3975(98)00332-6","volume":"242","author":"P Caron","year":"2000","unstructured":"Caron, P.: Families of locally testable languages. Theoret. Comput. Sci. 242(1), 361\u2013376 (2000). https:\/\/doi.org\/10.1016\/S0304-3975(98)00332-6","journal-title":"Theoret. Comput. Sci."},{"issue":"11","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1016\/j.scico.2010.04.012","volume":"75","author":"LG Cleophas","year":"2010","unstructured":"Cleophas, L.G., Watson, B.W., Zwaan, G.: A new taxonomy of sublinear right-to-left scanning keyword pattern matching algorithms. Sci. Comput. Program. 75(11), 1095\u20131112 (2010). https:\/\/doi.org\/10.1016\/j.scico.2010.04.012","journal-title":"Sci. Comput. Program."},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-09510-1_10","volume-title":"Automata, Languages and Programming","author":"B Commentz-Walter","year":"1979","unstructured":"Commentz-Walter, B.: A string matching algorithm fast on the average. In: Maurer, H.A. (ed.) ICALP 1979. LNCS, vol. 71, pp. 118\u2013132. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09510-1_10"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/978-3-662-07675-0_9","volume-title":"Handbook of Formal Languages","author":"M Crochemore","year":"1997","unstructured":"Crochemore, M., Hancart, C.: Automata for matching patterns. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, pp. 399\u2013462. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/978-3-662-07675-0_9"},{"key":"23_CR10","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Hancart, C.: Pattern matching in strings. In: Algorithms and Theory of Computation Handbook. Chapman & Hall\/CRC Applied Algorithms and Data Structures Series. CRC Press (1999). https:\/\/doi.org\/10.1201\/9781420049503-c12","DOI":"10.1201\/9781420049503-c12"},{"key":"23_CR11","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, Oxford (1994). http:\/\/www-igm.univ-mlv.fr\/%7Emac\/REC\/B1.html"},{"key":"23_CR12","volume-title":"Counter-Free Automata","author":"R McNaughton","year":"1971","unstructured":"McNaughton, R., Papert, S.: Counter-Free Automata. MIT Press, Cambridge (1971)"},{"key":"23_CR13","doi-asserted-by":"publisher","unstructured":"Melichar, B.: String matching with k differences by finite automata. In: ICPR 1996, Vienna, Austria, 25\u201319 August 1996, pp. 256\u2013260. IEEE Computer Society (1996). https:\/\/doi.org\/10.1109\/ICPR.1996.546828","DOI":"10.1109\/ICPR.1996.546828"},{"key":"23_CR14","unstructured":"Melichar, B., Holub, J.: 6D classification of pattern matching problems. In: Proceedings of the Prague Stringology Club Workshop 1997, pp. 24\u201332 (1997)"},{"key":"23_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-030-38919-2_47","volume-title":"SOFSEM 2020: Theory and Practice of Computer Science","author":"\u0160 Plach\u00fd","year":"2020","unstructured":"Plach\u00fd, \u0160, Janou\u0161ek, J.: On synchronizing tree automata and their work\u2013optimal parallel run, usable for parallel tree pattern matching. In: Chatzigeorgiou, A., et al. (eds.) SOFSEM 2020. LNCS, vol. 12011, pp. 576\u2013586. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-38919-2_47"},{"key":"23_CR16","doi-asserted-by":"publisher","unstructured":"Rogers, J., Lambert, D.: Extracting forbidden factors from regular stringsets. In: Proceedings of the 15th Meeting on the Mathematics of Language, London, UK, pp. 36\u201346. Association for Computational Linguistics (2017). https:\/\/doi.org\/10.18653\/v1\/W17-3404","DOI":"10.18653\/v1\/W17-3404"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Rogers, J., Lambert, D.: Extracting subregular constraints from regular stringsets. J. Lang. Model. 7, 143 (2019). https:\/\/doi.org\/10.15398\/jlm.v7i2.209","DOI":"10.15398\/jlm.v7i2.209"},{"key":"23_CR18","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 3rd edn. Course Technology, Boston (2013)"},{"issue":"2","key":"23_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0167-6423(96)00008-1","volume":"27","author":"BW Watson","year":"1996","unstructured":"Watson, B.W., Zwaan, G.: A taxonomy of sublinear multiple keyword pattern matching algorithms. Sci. Comput. Program. 27(2), 85\u2013118 (1996). https:\/\/doi.org\/10.1016\/0167-6423(96)00008-1","journal-title":"Sci. Comput. Program."},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Watson, B.: Taxonomies and toolkits of regular language algorithms. Ph.D. thesis, Mathematics and Computer Science (1995). https:\/\/doi.org\/10.6100\/IR444299","DOI":"10.6100\/IR444299"},{"issue":"2","key":"23_CR21","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0022-0000(72)80020-5","volume":"6","author":"Y Zalcstein","year":"1972","unstructured":"Zalcstein, Y.: Locally testable languages. J. Comput. Syst. Sci. 6(2), 151\u2013167 (1972). https:\/\/doi.org\/10.1016\/S0022-0000(72)80020-5","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2024: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-52113-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:04:34Z","timestamp":1711569874000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"7 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cochem","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 February 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"49","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.uni-trier.de\/index.php?id=90670&L=2","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":"81","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":"33","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":"41% - 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.11","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":"7","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)"}}]}}