{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T21:03:40Z","timestamp":1757624620615,"version":"3.44.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032014740"},{"type":"electronic","value":"9783032014757"}],"license":[{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,17]],"date-time":"2025-08-17T00:00:00Z","timestamp":1755388800000},"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-01475-7_20","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T17:39:25Z","timestamp":1755365965000},"page":"294-310","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Sorting Circular Suffixes in\u00a0Linear Time"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1402-5298","authenticated-orcid":false,"given":"Nicola","family":"Cotumaccio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"issue":"6","key":"20_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"AV Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: an aid to bibliographic search. Commun. ACM 18(6), 333\u2013340 (1975). https:\/\/doi.org\/10.1145\/360825.360855","journal-title":"Commun. ACM"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Alanko, J., Cotumaccio, N., Prezza, N.: Linear-time minimization of Wheeler DFAs. In: 2022 Data Compression Conference (DCC), pp. 53\u201362. IEEE (2022)","DOI":"10.1109\/DCC52660.2022.00013"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Alanko, J., D\u2019Agostino, G., Policriti, A., Prezza, N.: Regular languages meet prefix sorting. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 911\u2013930. SIAM (2020)","DOI":"10.1137\/1.9781611975994.55"},{"key":"20_CR4","unstructured":"Alanko, J.N., Cenzato, D., Cotumaccio, N., Kim, S.H., Manzini, G., Prezza, N.: Computing the LCP array of a labeled graph. In: 35th Annual Symposium on Combinatorial Pattern Matching (CPM 2024). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"2123","DOI":"10.1007\/s00453-018-0526-2","volume":"81","author":"A Amir","year":"2019","unstructured":"Amir, A., Kopelowitz, T., Levy, A., Pettie, S., Porat, E., Shalom, B.R.: Mind the gap! Online dictionary matching with one gap. Algorithmica 81, 2123\u20132157 (2019)","journal-title":"Algorithmica"},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2015.04.011","volume":"589","author":"A Amir","year":"2015","unstructured":"Amir, A., Levy, A., Porat, E., Shalom, B.R.: Dictionary matching with a few gaps. Theoret. Comput. Sci. 589, 34\u201346 (2015)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR7","unstructured":"Baier, U.: Linear-time suffix sorting-a new approach for suffix array construction. In: 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), pp. 23:1\u201323:12. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"key":"20_CR8","unstructured":"Bannai, H., K\u00e4rkk\u00e4inen, J., K\u00f6ppl, D., Pi\u0105tkowski, M.: Constructing the bijective and the extended Burrows-Wheeler transform in linear time. In: 32nd Annual Symposium on Combinatorial Pattern Matching (CPM 2021). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-13509-5_9","volume-title":"Combinatorial Pattern Matching","author":"D Belazzougui","year":"2010","unstructured":"Belazzougui, D.: Succinct dictionary matching with no slowdown. In: Amir, A., Parida, L. (eds.) Combinatorial Pattern Matching, pp. 88\u2013100. Springer, Berlin, Heidelberg (2010)"},{"issue":"2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3381417","volume":"16","author":"D Belazzougui","year":"2020","unstructured":"Belazzougui, D., Cunial, F., K\u00e4rkk\u00e4inen, J., M\u00e4kinen, V.: Linear-time string indexing and analysis in small space. ACM TALG 16(2), 1\u201354 (2020)","journal-title":"ACM TALG"},{"issue":"08","key":"20_CR11","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1142\/S0129054114400309","volume":"25","author":"S Bonomo","year":"2014","unstructured":"Bonomo, S., Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: Sorting conjugates and suffixes of words in a multiset. Int. J. Found. Comput. Sci. 25(08), 1161\u20131175 (2014)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"4\u20135","key":"20_CR12","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1016\/0020-0190(80)90149-0","volume":"10","author":"KS Booth","year":"1980","unstructured":"Booth, K.S.: Lexicographically least circular substrings. Inf. Process. Lett. 10(4\u20135), 240\u2013242 (1980)","journal-title":"Inf. Process. Lett."},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-030-86692-1_11","volume-title":"String Processing and Information Retrieval","author":"C Boucher","year":"2021","unstructured":"Boucher, C., Cenzato, D., Lipt\u00e1k, Z., Rossi, M., Sciortino, M.: Computing the original eBWT faster, simpler, and with less memory. In: Lecroq, T., Touzet, H. (eds.) String Processing and Information Retrieval, pp. 129\u2013142. Springer, Cham (2021)"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"105155","DOI":"10.1016\/j.ic.2024.105155","volume":"298","author":"C Boucher","year":"2024","unstructured":"Boucher, C., Cenzato, D., Lipt\u00e1k, Z., Rossi, M., Sciortino, M.: r-indexing the eBWT. Inf. Comput. 298, 105155 (2024)","journal-title":"Inf. Comput."},{"issue":"7","key":"20_CR15","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1007\/s00453-021-00821-y","volume":"83","author":"P Charalampopoulos","year":"2021","unstructured":"Charalampopoulos, P., Kociumaka, T., Mohamed, M., Radoszewski, J., Rytter, W., Wale\u0144, T.: Internal dictionary matching. Algorithmica 83(7), 2142\u20132169 (2021)","journal-title":"Algorithmica"},{"key":"20_CR16","unstructured":"Charalampopoulos, P., et al.: Approximate circular pattern matching. In: ESA 2022-30th Annual European Symposium on Algorithms (2022)"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Clifford, R., Fontaine, A., Porat, E., Sach, B., Starikovskaya, T.: Dictionary matching in a stream. In: Algorithms-ESA 2015: 23rd Annual European Symposium, Patras, Greece, September 14\u201316, 2015, Proceedings. pp. 361\u2013372. Springer (2015)","DOI":"10.1007\/978-3-662-48350-3_31"},{"key":"20_CR18","doi-asserted-by":"publisher","unstructured":"Conte, A., Cotumaccio, N., Gagie, T., Manzini, G., Prezza, N., Sciortino, M.: Computing matching statistics on Wheeler DFAs. In: 2023 Data Compression Conference (DCC), pp. 150\u2013159 (2023). https:\/\/doi.org\/10.1109\/DCC55655.2023.00023","DOI":"10.1109\/DCC55655.2023.00023"},{"key":"20_CR19","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N.: Graphs can be succinctly indexed for pattern matching in $$O(\\vert E\\vert ^{2}+\\vert V\\vert ^{5\/2})$$ time. In: 2022 Data Compression Conference (DCC), pp. 272\u2013281 (2022). https:\/\/doi.org\/10.1109\/DCC52660.2022.00035","DOI":"10.1109\/DCC52660.2022.00035"},{"key":"20_CR20","unstructured":"Cotumaccio, N.: Prefix sorting DFAs: a recursive algorithm. In: 34th International Symposium on Algorithms and Computation (ISAAC 2023). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik (2023)"},{"key":"20_CR21","unstructured":"Cotumaccio, N.: A Myhill-Nerode theorem for generalized automata, with applications to pattern matching and compression. In: 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"20_CR22","unstructured":"Cotumaccio, N.: Improved circular dictionary matching. In: 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025), pp. 18\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2025)"},{"key":"20_CR23","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N., D\u2019Agostino, G., Policriti, A., Prezza, N.: Co-lexicographically ordering automata and regular languages - part I. J. ACM 70(4) (2023). https:\/\/doi.org\/10.1145\/3607471","DOI":"10.1145\/3607471"},{"key":"20_CR24","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-031-43980-3_12","volume-title":"String Processing and Information Retrieval","author":"N Cotumaccio","year":"2023","unstructured":"Cotumaccio, N., Gagie, T., K\u00f6ppl, D., Prezza, N.: Space-time trade-offs for the LCP array of Wheeler DFAs. In: Nardini, F.M., Pisanti, N., Venturini, R. (eds.) String Processing and Information Retrieval, pp. 143\u2013156. Springer, Cham (2023)"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Cotumaccio, N., Prezza, N.: On indexing and compressing finite automata. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2585\u20132599. SIAM (2021)","DOI":"10.1137\/1.9781611976465.153"},{"key":"20_CR26","unstructured":"Cotumaccio, N., Trubiani, C.: Convex Petri nets. In: K\u00f6hler-Bussmeier, M., Moldt, D., R\u00f6lke, H. (eds.) Proceedings of the International Workshop on Petri Nets and Software Engineering 2024 co-located with the 45th International Conference on Application and Theory of Petri Nets and Concurrency (PETRI NETS 2024), June 24\u201325, 2024, Geneva, Switzerland. CEUR Workshop Proceedings, vol.\u00a03730. CEUR-WS.org (2024)"},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"e82","DOI":"10.1371\/journal.pbio.0050082","volume":"5","author":"JA Eisen","year":"2007","unstructured":"Eisen, J.A.: Environmental shotgun sequencing: its potential and challenges for studying the hidden world of microbes. PLoS Biol. 5(3), e82 (2007)","journal-title":"PLoS Biol."},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Farach, M.: Optimal suffix tree construction with large alphabets. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 137\u2013143. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646102"},{"key":"20_CR29","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.tcs.2017.06.016","volume":"698","author":"T Gagie","year":"2017","unstructured":"Gagie, T., Manzini, G., Sir\u00e9n, J.: Wheeler graphs: a framework for BWT-based data structures. Theoret. Comput. Sci. 698, 67\u201378 (2017)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR30","unstructured":"Gawrychowski, P., Starikovskaya, T.: Streaming dictionary matching with mismatches. Algorithmica, 1\u201321 (2019)"},{"key":"20_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-3-030-24766-9_30","volume-title":"Algorithms and Data Structures","author":"S Golan","year":"2019","unstructured":"Golan, S., Kociumaka, T., Kopelowitz, T., Porat, E.: Dynamic dictionary matching in the online model. In: Friggstad, Z., Sack, J.-R., Salavatipour, M.R. (eds.) WADS 2019. LNCS, vol. 11646, pp. 409\u2013422. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-24766-9_30"},{"key":"20_CR32","doi-asserted-by":"publisher","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences - Computer Science and Computational Biology. Cambridge University Press (1997). https:\/\/doi.org\/10.1017\/CBO9780511574931","DOI":"10.1017\/CBO9780511574931"},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-31265-6_21","volume-title":"Combinatorial Pattern Matching","author":"WK Hon","year":"2012","unstructured":"Hon, W.K., Ku, T.H., Lu, C.H., Shah, R., Thankachan, S.V.: Efficient algorithm for circular Burrows-Wheeler transform. In: K\u00e4rkk\u00e4inen, J., Stoye, J. (eds.) Combinatorial Pattern Matching, pp. 257\u2013268. Springer, Berlin, Heidelberg (2012)"},{"key":"20_CR34","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-38905-4_15","volume-title":"Combinatorial Pattern Matching","author":"WK Hon","year":"2013","unstructured":"Hon, W.K., Ku, T.H., Shah, R., Thankachan, S.V.: Space-efficient construction algorithm for the circular suffix tree. In: Fischer, J., Sanders, P. (eds.) Combinatorial Pattern Matching, pp. 142\u2013152. Springer, Berlin, Heidelberg (2013)"},{"key":"20_CR35","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.tcs.2012.10.050","volume":"475","author":"WK Hon","year":"2013","unstructured":"Hon, W.K., Ku, T.H., Shah, R., Thankachan, S.V., Vitter, J.S.: Faster compressed dictionary matching. Theoret. Comput. Sci. 475, 113\u2013119 (2013). https:\/\/doi.org\/10.1016\/j.tcs.2012.10.050","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR36","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1007\/s00453-017-0288-2","volume":"80","author":"WK Hon","year":"2018","unstructured":"Hon, W.K., Lam, T.W., Shah, R., Thankachan, S.V., Ting, H.F., Yang, Y.: Dictionary matching with a bounded gap in pattern or in text. Algorithmica 80, 698\u2013713 (2018)","journal-title":"Algorithmica"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-25591-5_69","volume-title":"Algorithms and Computation","author":"W-K Hon","year":"2011","unstructured":"Hon, W.-K., Lu, C.-H., Shah, R., Thankachan, S.V.: Succinct indexes for circular patterns. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 673\u2013682. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25591-5_69"},{"key":"20_CR38","volume-title":"Data Structures and Algorithms","author":"JE Hopcroft","year":"1983","unstructured":"Hopcroft, J.E., Ullman, J.D., Aho, A.V.: Data Structures and Algorithms, vol. 175. Addison-wesley, Boston, MA, USA (1983)"},{"key":"20_CR39","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., Pissis, S.P., Rahman, M.S.: Searching and indexing circular patterns. In: Algorithms for Next-Generation Sequencing Data: Techniques, Approaches, and Applications, pp. 77\u201390 (2017)","DOI":"10.1007\/978-3-319-59826-0_3"},{"key":"20_CR40","doi-asserted-by":"crossref","unstructured":"Iliopoulos, C.S., Rahman, M.S.: Indexing circular patterns. In: Nakano, S.I., Rahman, M.S. (eds.) WALCOM: Algorithms and Computation, pp. 46\u201357. Springer, Berlin, Heidelberg (2008)","DOI":"10.1007\/978-3-540-77891-2_5"},{"issue":"2\u20134","key":"20_CR41","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.jda.2004.08.002","volume":"3","author":"P Ko","year":"2005","unstructured":"Ko, P., Aluru, S.: Space efficient linear time construction of suffix arrays. J. Disc. Algorithms 3(2\u20134), 143\u2013156 (2005)","journal-title":"J. Disc. Algorithms"},{"key":"20_CR42","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Combinatorics on Words, vol.\u00a017. Cambridge University Press (1997)","DOI":"10.1017\/CBO9780511566097"},{"issue":"3","key":"20_CR43","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1145\/321892.321896","volume":"22","author":"G Manacher","year":"1975","unstructured":"Manacher, G.: A new linear-time on-line algorithm for finding the smallest initial palindrome of a string. J. ACM (JACM) 22(3), 346\u2013351 (1975)","journal-title":"J. ACM (JACM)"},{"issue":"3","key":"20_CR44","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2007.07.014","volume":"387","author":"S Mantaci","year":"2007","unstructured":"Mantaci, S., Restivo, A., Rosone, G., Sciortino, M.: An extension of the Burrows-Wheeler transform. Theoret. Comput. Sci. 387(3), 298\u2013312 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"20_CR45","doi-asserted-by":"crossref","unstructured":"Munro, J.I., Navarro, G., Nekrich, Y.: Space-efficient construction of compressed indexes in deterministic linear time. In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 408\u2013424. SIAM (2017)","DOI":"10.1137\/1.9781611974782.26"},{"issue":"10","key":"20_CR46","doi-asserted-by":"publisher","first-page":"1471","DOI":"10.1109\/TC.2010.188","volume":"60","author":"G Nong","year":"2011","unstructured":"Nong, G., Zhang, S., Chan, W.H.: Two efficient algorithms for linear time suffix array construction. IEEE Trans. Comput. 60(10), 1471\u20131484 (2011). https:\/\/doi.org\/10.1109\/TC.2010.188","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"20_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3641854","volume":"20","author":"J Olbrich","year":"2024","unstructured":"Olbrich, J., Ohlebusch, E., B\u00fcchler, T.: Generic non-recursive suffix array construction. ACM Trans. Algorithms 20(2), 1\u201342 (2024)","journal-title":"ACM Trans. Algorithms"},{"issue":"6","key":"20_CR48","doi-asserted-by":"publisher","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R Paige","year":"1987","unstructured":"Paige, R., Tarjan, R.E.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"20_CR49","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1007\/s00224-006-1198-x","volume":"41","author":"K Sadakane","year":"2007","unstructured":"Sadakane, K.: Compressed suffix trees with full functionality. Theor. Comp. Sys. 41(4), 589\u2013607 (2007). https:\/\/doi.org\/10.1007\/s00224-006-1198-x","journal-title":"Theor. Comp. Sys."},{"issue":"4","key":"20_CR50","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1128\/AEM.02345-10","volume":"77","author":"C Simon","year":"2011","unstructured":"Simon, C., Daniel, R.: Metagenomic analyses: past and future trends. Appl. Environ. Microbiol. 77(4), 1153\u20131161 (2011)","journal-title":"Appl. Environ. Microbiol."},{"issue":"19","key":"20_CR51","doi-asserted-by":"publisher","first-page":"12487","DOI":"10.1128\/JVI.79.19.12487-12494.2005","volume":"79","author":"BL Strang","year":"2005","unstructured":"Strang, B.L., Stow, N.D.: Circularization of the herpes simplex virus type 1 genome upon lytic infection. J. Virol. 79(19), 12487\u201312494 (2005)","journal-title":"J. Virol."},{"key":"20_CR52","doi-asserted-by":"publisher","unstructured":"Cotumaccio, N.: Fast pattern matching with epsilon transitions. In: Fernau, H., Zhu, B. (eds.) International Workshop on Combinatorial Algorithms 2025. LNCS, vol. 15885, pp. 242\u2013255. Springer, Cham (2025). https:\/\/doi.org\/10.1007\/978-3-031-98740-3_18","DOI":"10.1007\/978-3-031-98740-3_18"},{"key":"20_CR53","unstructured":"Becker, R., Cotumaccio, N., Kim, S.-H., Prezza, N., Tosoni, C.: Encoding Co-Lex orders of finite-state automata in linear space. In: 36th Annual Symposium on Combinatorial Pattern Matching (CPM 2025), pp. 15\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2025)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01475-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T15:13:16Z","timestamp":1757430796000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01475-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,17]]},"ISBN":["9783032014740","9783032014757"],"references-count":53,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01475-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025,8,17]]},"assertion":[{"value":"17 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DLT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Developments in Language Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Seoul","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Korea (Republic of)","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":"19 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cida.uos.ac.kr\/dlt2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}