{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T00:10:17Z","timestamp":1758586217971,"version":"3.44.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_2","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:30Z","timestamp":1758498330000},"page":"15-29","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds for\u00a0the\u00a0Number of\u00a0Absent Subsequences"],"prefix":"10.1007","author":[{"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[]},{"given":"Pamela","family":"Fleischmann","sequence":"additional","affiliation":[]},{"given":"Annika","family":"Huch","sequence":"additional","affiliation":[]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[]},{"given":"Paul","family":"Sarnighausen-Cahn","sequence":"additional","affiliation":[]},{"given":"Max","family":"Wiedenh\u00f6ft","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"2_CR1","unstructured":"Adamson, D., Fleischmann, P., Huch, A., Ko\u00df, T., Manea, F., Nowotka, D.: k-universality of regular languages. In: ISAAC. LIPIcs, vol.\u00a0283, pp. 4:1\u20134:21 (2023)"},{"key":"2_CR2","doi-asserted-by":"publisher","unstructured":"Adamson, D., Gawrychowski, P., Manea, F.: Enumerating m-length walks in directed graphs with constant delay. In: Soto, J.A., Wiese, A. (eds.) LATIN 2024: Theoretical Informatics. LATIN 2024. LNCS, vol. 14578, pp. 35\u201350. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-55598-5_3","DOI":"10.1007\/978-3-031-55598-5_3"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Adamson, D., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Longest common subsequence with gap constraints. In: WORDS, pp. 60\u201376 (2023)","DOI":"10.1007\/978-3-031-33180-0_5"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Artikis, A., Margara, A., Ugarte, M., Vansummeren, S., Weidlich, M.: Complex event recognition languages: tutorial. In: DEBS, pp. 7\u201310 (2017)","DOI":"10.1145\/3093742.3095106"},{"key":"2_CR5","doi-asserted-by":"publisher","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","DOI":"10.1007\/978-3-030-48516-0_2"},{"key":"2_CR6","doi-asserted-by":"publisher","unstructured":"Bender, M.A., Farach-Colton, M.: The level ancestor problem simplified. In: Rajsbaum, S. (ed.) LATIN 2002. LNCS, vol. 2286, pp. 508\u2013515. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45995-2_44","DOI":"10.1007\/3-540-45995-2_44"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Buzzega, G., Conte, A., Kobayashi, Y., Kurita, K., Punzi, G.: The complexity of maximal common subsequence enumeration. Proc. ACM Manag. Data 3(2) (2025)","DOI":"10.1145\/3725252"},{"issue":"3","key":"2_CR8","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1007\/s00453-021-00898-5","volume":"84","author":"A Conte","year":"2022","unstructured":"Conte, A., Grossi, R., Punzi, G., Uno, T.: Enumeration of maximal common subsequences between two strings. Algorithmica 84(3), 757\u2013783 (2022)","journal-title":"Algorithmica"},{"issue":"3\u20134","key":"2_CR9","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/S1570-8667(03)00029-7","volume":"1","author":"M Crochemore","year":"2003","unstructured":"Crochemore, M., Melichar, B., Tron\u00edcek, Z.: Directed acyclic subsequence graph - overview. J. Discret. Algorithms 1(3\u20134), 255\u2013280 (2003)","journal-title":"J. Discret. Algorithms"},{"key":"2_CR10","unstructured":"Day, J.D., Fleischmann, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: The edit distance to k-subsequence universality. In: STACS. LIPIcs, vol.\u00a0187, pp. 25:1\u201325:19 (2021)"},{"key":"2_CR11","unstructured":"Day, J.D., Kosche, M., Manea, F., Schmid, M.L.: Subsequences with gap constraints: complexity bounds for matching and analysis problems. In: ISAAC. LIPIcs, vol.\u00a0248, pp. 64:1\u201364:18 (2022)"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s00026-004-0232-4","volume":"8","author":"AWM Dress","year":"2005","unstructured":"Dress, A.W.M., Erd\u0151s, P.L.: Reconstructing words from subwords in linear time. Ann. Comb. 8, 457\u2013462 (2005)","journal-title":"Ann. Comb."},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1016\/j.tcs.2008.08.035","volume":"409","author":"C Elzinga","year":"2008","unstructured":"Elzinga, C., Rahmann, S., Wang, H.: Algorithms for subsequence combinatorics. TCS 409(3), 394\u2013404 (2008)","journal-title":"TCS"},{"key":"2_CR14","unstructured":"Fleischer, L., Kufleitner, M.: Testing Simon\u2019s congruence. In: MFCS. LIPIcs, vol.\u00a0117, pp. 62:1\u201362:13 (2018)"},{"key":"2_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114113","volume":"974","author":"P Fleischmann","year":"2023","unstructured":"Fleischmann, P., Haschke, L., H\u00f6fer, J., Huch, A., Mayrock, A., Nowotka, D.: Nearly k-universal words - investigating a part of Simon\u2019s congruence. TCS 974, 114113 (2023)","journal-title":"TCS"},{"key":"2_CR16","doi-asserted-by":"publisher","unstructured":"Fleischmann, P., H\u00f6fer, J., Huch, A., Nowotka, D.: $$\\alpha $$-$$\\beta $$-factorization and the binary case of Simon\u2019s congruence. In: Fernau, H., Jansen, K. (eds.) Fundamentals of Computation Theory. FCT 2023. LNCS, vol. 14292, pp. 190\u2013204. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-43587-4_14","DOI":"10.1007\/978-3-031-43587-4_14"},{"key":"2_CR17","doi-asserted-by":"publisher","unstructured":"Fleischmann, P., et al.: Matching patterns with variables under Simon\u2019s congruence. In: Bournez, O., Formenti, E., Potapov, I. (eds.) Reachability Problems. RP 2023. LNCS, vol. 14235, pp. 155\u2013170. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-45286-4_12","DOI":"10.1007\/978-3-031-45286-4_12"},{"issue":"6","key":"2_CR18","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1142\/S0129054121420016","volume":"32","author":"P Fleischmann","year":"2021","unstructured":"Fleischmann, P., Lejeune, M., Manea, F., Nowotka, D., Rigo, M.: Reconstructing words from right-bounded-block words. Int. J. Found. Comput. Sci. 32(6), 619\u2013640 (2021)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"2_CR19","unstructured":"Gawrychowski, P., Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Efficiently testing Simon\u2019s congruence. In: STACS. LIPIcs, vol.\u00a0187, pp. 34:1\u201334:18 (2021)"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Halfon, S., Schnoebelen, P., Zetzsche, G.: Decidability, complexity, and expressiveness of first-order logic over the subword ordering. In: LICS, pp. 1\u201312. IEEE Computer Society (2017)","DOI":"10.1109\/LICS.2017.8005141"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(91)90170-7","volume":"82","author":"J H\u00e9brard","year":"1991","unstructured":"H\u00e9brard, J.: An algorithm for distinguishing efficiently bit-strings by their subsequences. TCS 82(1), 35\u201349 (1991)","journal-title":"TCS"},{"issue":"4","key":"2_CR22","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, P.: On the index of Simon\u2019s congruence for piecewise testability. Inf. Process. Lett. 115(4), 515\u2013519 (2015)","journal-title":"Inf. Process. Lett."},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Karandikar, P., Schnoebelen, P.: The height of piecewise-testable languages and the complexity of the logic of subwords. Log. Methods Comput. Sci. 15(2) (2019)","DOI":"10.23638\/LMCS-15(2:6)2019"},{"issue":"6","key":"2_CR24","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53(6), 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"2_CR25","doi-asserted-by":"crossref","unstructured":"K\u00e1tai-Urb\u00e1n, K., Pach, P.P., Pluh\u00e1r, G., Pongr\u00e1cz, A., Szab\u00f3, C.: On the word problem for syntactic monoids of piecewise testable languages. In: Semigroup Forum, vol.\u00a084, pp. 323\u2013332. Springer (2012)","DOI":"10.1007\/s00233-011-9357-z"},{"key":"2_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114078","volume":"972","author":"S Kim","year":"2023","unstructured":"Kim, S., Han, Y., Ko, S., Salomaa, K.: On Simon\u2019s congruence closure of a string. TCS 972, 114078 (2023)","journal-title":"TCS"},{"key":"2_CR27","doi-asserted-by":"publisher","unstructured":"Kim, S., Han, Y.S., Ko, S.K., Salomaa, K.: On the Simon\u2019s congruence neighborhood of languages. In: Drewes, F., Volkov, M. (eds.) Developments in Language Theory. DLT 2023. LNCS, vol. 13911, pp. 168\u2013181. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-33264-7_14","DOI":"10.1007\/978-3-031-33264-7_14"},{"key":"2_CR28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.114478","volume":"994","author":"S Kim","year":"2024","unstructured":"Kim, S., Ko, S., Han, Y.: Simon\u2019s congruence pattern matching. TCS 994, 114478 (2024)","journal-title":"TCS"},{"key":"2_CR29","unstructured":"Kleest-Mei\u00dfner, S., Sattler, R., Schmid, M.L., Schweikardt, N., Weidlich, M.: Discovering event queries from traces: laying foundations for subsequence-queries with wildcards and gap-size constraints. In: ICDT. LIPIcs, vol.\u00a0220, pp. 18:1\u201318:21 (2022)"},{"key":"2_CR30","unstructured":"Kleest-Mei\u00dfner, S., Sattler, R., Schmid, M.L., Schweikardt, N., Weidlich, M.: Discovering multi-dimensional subsequence queries from traces - from theory to practice. In: BTW. LNI, vol. P-331, pp. 511\u2013533 (2023)"},{"issue":"3\u20134","key":"2_CR31","first-page":"199","volume":"189","author":"M Kosche","year":"2022","unstructured":"Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Absent subsequences in words. Fundam. Inform. 189(3\u20134), 199\u2013240 (2022)","journal-title":"Fundam. Inform."},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Kosche, M., Ko\u00df, T., Manea, F., Siemer, S.: Combinatorial algorithms for subsequence matching: a survey. In: NCMA, vol. 367, pp. 11\u201327 (2022)","DOI":"10.4204\/EPTCS.367.2"},{"key":"2_CR33","doi-asserted-by":"publisher","unstructured":"Kuske, D., Zetzsche, G.: Languages ordered by the subword order. In: Boja\u0144czyk, M., Simpson, A. (eds.) Foundations of Software Science and Computation Structures. FoSSaCS 2019. LNCS, vol. 11425, pp. 348\u2013364. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17127-8_20","DOI":"10.1007\/978-3-030-17127-8_20"},{"key":"2_CR34","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on Words. Cambridge University Press, Cambridge Mathematical Library (1997)","DOI":"10.1017\/CBO9780511566097"},{"key":"2_CR35","unstructured":"Manea, F., Richardsen, J., Schmid, M.L.: Subsequences with generalised gap constraints: upper and lower complexity bounds. In: CPM. LIPIcs, vol.\u00a0296, pp. 22:1\u201322:17 (2024)"},{"key":"2_CR36","doi-asserted-by":"crossref","unstructured":"Manuch, J.: Characterization of a word by its subwords. In: DLT 1999, pp. 210\u2013219. World Scientific (1999)","DOI":"10.1142\/9789812792464_0018"},{"key":"2_CR37","doi-asserted-by":"crossref","unstructured":"Pach, P.P.: Normal forms under Simon\u2019s congruence. In: Semigroup Forum, vol.\u00a097, pp. 251\u2013267. Springer (2018)","DOI":"10.1007\/s00233-017-9910-5"},{"key":"2_CR38","doi-asserted-by":"crossref","unstructured":"Pin, J.E.: The influence of Imre Simon\u2019s work in the theory of automata, languages and semigroups. In: Semigroup Forum, vol.\u00a098, pp.\u00a01\u20138. Springer (2019)","DOI":"10.1007\/s00233-019-09999-8"},{"key":"2_CR39","unstructured":"Sakai, Y.: Linear-space LCS enumeration for two strings. In: Bonizzoni, P., M\u00e4kinen, V. (eds.) CPM. LIPIcs, vol.\u00a0331, pp. 2:1\u20132:14 (2025)"},{"key":"2_CR40","unstructured":"Sakai, Y.: Linear-space LCS enumeration with quadratic-time delay for two strings. CoRR abs\/2504.05742 (2025)"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"Sattler, R., Kleest-Mei\u00dfner, S., Lange, S., Schmid, M.L., Schweikardt, N., Weidlich, M.: Disces: systematic discovery of event stream queries. Proc. ACM Manag. Data 3(1) (2025)","DOI":"10.1145\/3709682"},{"key":"2_CR42","unstructured":"Simon, I.: Hierarchies of events with dot-depth one. Ph.D. thesis, University of Waterloo (1972)"},{"key":"2_CR43","doi-asserted-by":"publisher","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","DOI":"10.1007\/3-540-07407-4_23"},{"key":"2_CR44","unstructured":"Zetzsche, G.: The complexity of downward closure comparisons. In: ICALP. LIPIcs, vol.\u00a055, pp. 123:1\u2013123:14 (2016)"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:34Z","timestamp":1758498334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}