{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:28:16Z","timestamp":1762291696503,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032095237","type":"print"},{"value":"9783032095244","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T00:00:00Z","timestamp":1762300800000},"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-09524-4_5","type":"book-chapter","created":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:07Z","timestamp":1762290847000},"page":"68-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Word Chain Generators for\u00a0Prefix Normal Words"],"prefix":"10.1007","author":[{"given":"Duncan","family":"Adamson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moritz","family":"Dudey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pamela","family":"Fleischmann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annika","family":"Huch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,5]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.tcs.2019.03.036","volume":"784","author":"P Balister","year":"2019","unstructured":"Balister, P., Gerke, S.: The asymptotic number of prefix normal words. Theor. Comput. Sci. 784, 75\u201380 (2019)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"5_CR2","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1142\/S0129054112400175","volume":"23","author":"P Burcsi","year":"2012","unstructured":"Burcsi, P., Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Algorithms for jumbled pattern matching in strings. Int. J. Found. Comput. Sci. 23(2), 357\u2013374 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Z., Ruskey, F., Sawada, J.: Normal, abby normal, prefix normal. In: FUN 2014, Proceedings, volume 8496 of LNCS, pp. 74\u201388. Springer (2014)","DOI":"10.1007\/978-3-319-07890-8_7"},{"key":"5_CR4","doi-asserted-by":"publisher","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Z., Ruskey, F., Sawada, J.: On combinatorial generation of prefix normal words. In: Kulikov, A.S., Kuznetsov, S.O., Pevzner, P. (eds.) CPM 2014. LNCS, vol. 8486, pp. 60\u201369. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07566-2_7","DOI":"10.1007\/978-3-319-07566-2_7"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2016.10.015","volume":"659","author":"P Burcsi","year":"2017","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Z., Ruskey, F., Sawada, J.: On prefix normal words and prefix normal forms. Theor. Comput. Sci. 659, 1\u201313 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2020.07.035","volume":"842","author":"P Burcsi","year":"2020","unstructured":"Burcsi, P., Fici, G., Lipt\u00e1k, Z., Raman, R., Sawada, J.: Generating a gray code for prefix normal words in amortized polylogarithmic time per word. Theor. Comput. Sci. 842, 86\u201399 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR7","unstructured":"Cicalese, F., Fici, G., Lipt\u00e1k, Z.: Searching for jumbled patterns in strings. In: Proceedings of the Prague Stringology Conference 2009, pp. 105\u2013117. Prague Stringology Club, Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University in Prague (2009)"},{"key":"5_CR8","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.tcs.2018.06.021","volume":"743","author":"F Cicalese","year":"2018","unstructured":"Cicalese, F., Lipt\u00e1k, Z., Rossi, M.: Bubble-flip - a new generation algorithm for prefix normal words. Theor. Comput. Sci. 743, 38\u201352 (2018)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1016\/j.tcs.2021.01.015","volume":"859","author":"F Cicalese","year":"2021","unstructured":"Cicalese, F., Lipt\u00e1k, Z., Rossi, M.: On infinite prefix normal words. Theor. Comput. Sci. 859, 134\u2013148 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-030-81508-0_12","volume-title":"Developments in Language Theory","author":"Y Eikmeier","year":"2021","unstructured":"Eikmeier, Y., Fleischmann, P., Kulczynski, M., Nowotka, D.: Weighted prefix normal words: mind the gap. In: Moreira, N., Reis, R. (eds.) DLT 2021. LNCS, vol. 12811, pp. 143\u2013154. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-81508-0_12"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-22321-1_20","volume-title":"Developments in Language Theory","author":"G Fici","year":"2011","unstructured":"Fici, G., Lipt\u00e1k, Z.: On prefix normal words. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol. 6795, pp. 228\u2013238. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22321-1_20"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1007\/978-3-030-40608-0_29","volume-title":"Language and Automata Theory and Applications","author":"P Fleischmann","year":"2020","unstructured":"Fleischmann, P., Kulczynski, M., Nowotka, D., Poulsen, D.B.: On collapsing prefix normal words. In: Leporati, A., Mart\u00edn-Vide, C., Shapira, D., Zandron, C. (eds.) LATA 2020. LNCS, vol. 12038, pp. 412\u2013424. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40608-0_29"},{"issue":"3","key":"5_CR13","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1007\/s00453-014-9957-6","volume":"73","author":"T Gagie","year":"2015","unstructured":"Gagie, T., Hermelin, D., Landau, G.M., Weimann, O.: Binary jumbled pattern matching on trees and tree-like structures. Algorithmica 73(3), 571\u2013588 (2015)","journal-title":"Algorithmica"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1007\/978-3-642-34109-0_35","volume-title":"String Processing and Information Retrieval","author":"L-K Lee","year":"2012","unstructured":"Lee, L.-K., Lewenstein, M., Zhang, Q.: Parikh matching in the streaming model. In: Calder\u00f3n-Benavides, L., Gonz\u00e1lez-Caro, C., Ch\u00e1vez, E., Ziviani, N. (eds.) SPIRE 2012. LNCS, vol. 7608, pp. 336\u2013341. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34109-0_35"},{"issue":"4","key":"5_CR15","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1145\/321356.321364","volume":"13","author":"R Parikh","year":"1966","unstructured":"Parikh, R.: On context-free languages. J. ACM 13(4), 570\u2013581 (1966)","journal-title":"J. ACM"},{"key":"5_CR16","first-page":"165","volume":"81","author":"A Salomaa","year":"2003","unstructured":"Salomaa, A.: Counting (scattered) subwords. Bull. EATheor. Comput. Sci. 81, 165\u2013179 (2003)","journal-title":"Bull. EATheor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Reachability Problems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-09524-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T21:14:08Z","timestamp":1762290848000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-09524-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,5]]},"ISBN":["9783032095237","9783032095244"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-09524-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,5]]},"assertion":[{"value":"5 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Reachability Problems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madrid","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"1 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"rp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/rp25.software.imdea.org\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}