{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T01:37:34Z","timestamp":1742953054416,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"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_32","type":"book-chapter","created":{"date-parts":[[2024,2,7]],"date-time":"2024-02-07T00:02:50Z","timestamp":1707264170000},"page":"456-470","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the\u00a0Piecewise Complexity of\u00a0Words and\u00a0Periodic Words"],"prefix":"10.1007","author":[{"given":"M.","family":"Praveen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ph.","family":"Schnoebelen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Veron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"I.","family":"Vialard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,7]]},"reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-030-48516-0_2","volume-title":"Developments in Language Theory","author":"L Barker","year":"2020","unstructured":"Barker, L., Fleischmann, P., Harwardt, K., Manea, F., Nowotka, D.: Scattered factor-universality of words. In: Jonoska, N., Savchuk, D. (eds.) DLT 2020. LNCS, vol. 12086, pp. 14\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48516-0_2"},{"issue":"3","key":"32_CR2","first-page":"1","volume":"8","author":"M Boja\u0144czyk","year":"2012","unstructured":"Boja\u0144czyk, M., Segoufin, L., Straubing, H.: Piecewise testable tree languages. Logical Methods Comput. Sci. 8(3), 1\u201332 (2012)","journal-title":"Logical Methods Comput. Sci."},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-319-98654-8_15","volume-title":"Developments in Language Theory","author":"O Carton","year":"2018","unstructured":"Carton, O., Pouzet, M.: Simon\u2019s theorem for scattered words. In: Hoshi, M., Seki, S. (eds.) DLT 2018. LNCS, vol. 11088, pp. 182\u2013193. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98654-8_15"},{"issue":"3","key":"32_CR4","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1142\/S0129054108005802","volume":"19","author":"V Diekert","year":"2008","unstructured":"Diekert, V., Gastin, P., Kufleitner, M.: A survey on small fragments of first-order logic over finite words. Int. J. Found. Comput. Sci. 19(3), 513\u2013548 (2008)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"32_CR5","unstructured":"Fleischer, L., Kufleitner, M.: Testing Simon\u2019s congruence. In: Proceedings of MFCS 2018, vol. 117 of Leibniz International Proceedings in Informatics, pp. 62:1\u201362:13. Leibniz-Zentrum f\u00fcr Informatik (2018)"},{"key":"32_CR6","unstructured":"Gawrychowski, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Efficiently testing Simon\u2019s congruence. In: Proceedings of STACS 2021, vol. 187 of Leibniz International Proceedings in Informatics, pp. 34:1\u201334:18. Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"32_CR7","unstructured":"Goubault-Larrecq, J., Schmitz, S.: Deciding piecewise testable separability for regular tree languages. In: Proceedings of ICALP 2016, vol. 55 of Leibniz International Proceedings in Informatics, pp. 97:1\u201397:15. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(91)90170-7","volume":"82","author":"J-J H\u00e9brard","year":"1991","unstructured":"H\u00e9brard, J.-J.: An algorithm for distinguishing efficiently bit-strings by their subsequences. Theor. Comput. Sci. 82(1), 35\u201349 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2019.01.012","volume":"145","author":"S Halfon","year":"2019","unstructured":"Halfon, S., Schnoebelen, Ph.: On shuffle products, acyclic automata and piecewise-testable languages. Inf. Process. Lett. 145, 68\u201373 (2019)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"32_CR10","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/j.tcs.2008.06.037","volume":"405","author":"L Kontorovich","year":"2008","unstructured":"Kontorovich, L., Cortes, C., Mohri, M.: Kernel methods for learning languages. Theor. Comput. Sci. 405(3), 223\u2013236 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"32_CR11","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1016\/j.ipl.2014.11.008","volume":"115","author":"P Karandikar","year":"2015","unstructured":"Karandikar, P., Kufleitner, M., Schnoebelen, Ph.: On the index of Simon\u2019s congruence for piecewise testability. Inf. Process. Lett. 115(4), 515\u2013519 (2015)","journal-title":"Inf. Process. Lett."},{"issue":"20","key":"32_CR12","doi-asserted-by":"publisher","first-page":"2124","DOI":"10.1016\/j.disc.2011.06.013","volume":"311","author":"O Kl\u00edma","year":"2011","unstructured":"Kl\u00edma, O.: Piecewise testable languages via combinatorics on words. Disc. Math. 311(20), 2124\u20132127 (2011)","journal-title":"Disc. Math."},{"key":"32_CR13","unstructured":"Karandikar, P., Schnoebelen, Ph.: The height of piecewise-testable languages with applications in logical complexity. In Proceedings of CSL 2016, vol. 62 of Leibniz International Proceedings in Informatics, pp. 37:1\u201337:22. Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"32_CR14","unstructured":"Karandikar, P., Schnoebelen, Ph.: The height of piecewise-testable languages and the complexity of the logic of subwords. Logical Methods Comput. Sci. 15(2) (2019)"},{"key":"32_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0053551","volume-title":"Foundations of Software Science and Computation Structures","author":"O Matz","year":"1998","unstructured":"Matz, O.: On piecewise testable, starfree, and recognizable picture languages. In: Nivat, M. (ed.) FoSSaCS 1998. LNCS, vol. 1378, pp. 203\u2013210. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0053551"},{"key":"32_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-319-21500-6_29","volume-title":"Developments in Language Theory","author":"T Masopust","year":"2015","unstructured":"Masopust, T., Thomazo, M.: On the complexity of k-piecewise testability and the depth of automata. In: Potapov, I. (ed.) DLT 2015. LNCS, vol. 9168, pp. 364\u2013376. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21500-6_29"},{"key":"32_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2215-3","volume-title":"Varieties of Formal Languages","author":"J\u00c9 Pin","year":"1986","unstructured":"Pin, J.\u00c9.: Varieties of Formal Languages. Plenum, New-York (1986)"},{"key":"32_CR18","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite words: Automata, Semigroups, Logic and Games, vol. 141 of Pure and Applied Mathematics Series. Elsevier (2004)"},{"key":"32_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-39998-5_6","volume-title":"Formal Grammar","author":"J Rogers","year":"2013","unstructured":"Rogers, J., Heinz, J., Fero, M., Hurst, J., Lambert, D., Wibel, S.: Cognitive and sub-regular complexity. In: Morrill, G., Nederhof, M.-J. (eds.) FG 2012-2013. LNCS, vol. 8036, pp. 90\u2013108. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39998-5_6"},{"key":"32_CR20","unstructured":"Simon, I.: Hierarchies of Event with Dot-Depth One. PhD thesis, University of Waterloo, Waterloo, ON, Canada (1972)"},{"key":"32_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/3-540-07407-4_23","volume-title":"Automata Theory and Formal Languages","author":"I Simon","year":"1975","unstructured":"Simon, I.: Piecewise testable events. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 214\u2013222. Springer, Heidelberg (1975). https:\/\/doi.org\/10.1007\/3-540-07407-4_23"},{"key":"32_CR22","unstructured":"Simon, I.: Words distinguished by their subwords. In: Proceedings of WORDS 2003 (2003)"},{"key":"32_CR23","unstructured":"Sakarovitch, J., Simon, I.: Subwords. In: Lothaire, M. (ed.) Combinatorics on Words, vol. 17 of Encyclopedia of Mathematics and Its Applications, chap. 6, pp. 105\u2013142. Cambridge University Press (1983)"},{"key":"32_CR24","doi-asserted-by":"publisher","unstructured":"Schnoebelen, Ph., Veron, J.: On arch factorization and subword universality for words and compressed words. In: Proceedings of WORDS 20123, vol. 13899 of Lecture Notes in Computer Science, pp. 274\u2013287. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-33180-0_21","DOI":"10.1007\/978-3-031-33180-0_21"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Zetzsche, G.: Separability by piecewise testable languages and downward closures beyond subwords. In: Proceedings of LICS 2018, pp. 929\u2013938. ACM Press (2018)","DOI":"10.1145\/3209108.3209201"}],"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_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,27]],"date-time":"2024-03-27T20:05:35Z","timestamp":1711569935000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-52113-3_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031521126","9783031521133"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-52113-3_32","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)"}}]}}