{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T00:04:48Z","timestamp":1780704288436,"version":"3.54.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032284037","type":"print"},{"value":"9783032284044","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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-28404-4_19","type":"book-chapter","created":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:20:49Z","timestamp":1780701649000},"page":"252-265","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Transformations between Minimally f-free Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6487-8619","authenticated-orcid":false,"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1838-9785","authenticated-orcid":false,"given":"Giuseppa","family":"Castiglione","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5676-6900","authenticated-orcid":false,"given":"Manuela","family":"Flores","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6100-9904","authenticated-orcid":false,"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3616-3173","authenticated-orcid":false,"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9200-0520","authenticated-orcid":false,"given":"Sabrina","family":"Mantaci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,6]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Isometric words based on swap and mismatch distance. In: Developments in Language Theory. DLT23. Lecture Notes Computer Science, vol. 13911, pp. 23\u201335. Springer Nature (2023). https:\/\/doi.org\/10.1007\/978-3-031-33264-7.3","DOI":"10.1007\/978-3-031-33264-7.3"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Isometric sets of words and generalizations of the Fibonacci cubes. In: Computability in Europe. CIE24, volume LNCS 14773 of Lect. Notes Computer Science, pp. 1\u201314. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-64309-5.35","DOI":"10.1007\/978-3-031-64309-5.35"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Hypercubes and isometric words based on swap and mismatch distance. In: DCFS23, volume 13918 of Lect. Notes Computer Science, pp. 21\u201335. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-34326-1.2","DOI":"10.1007\/978-3-031-34326-1.2"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Castiglione, G., Flores, M., Giammarresi, D., Madonia, M., Mantaci, S.: Characterization of isometric words based on swap and mismatch distance. IJFCS, 0(0), 1\u201325 (2025). https:\/\/doi.org\/10.1142\/S0129054125430051","DOI":"10.1142\/S0129054125430051"},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Flores, M., Madonia, M.: Fun slot machines and transformations of words avoiding factors. In: Fun with Algorithms, volume 226 of LIPIcs, pp. 4:1\u20134:15 (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2022.4","DOI":"10.4230\/LIPIcs.FUN.2022.4"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Flores, M., Madonia, M.: On K-ary n-cubes and isometric words. Theor. Comput. Sci. 938, 50\u201364 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.10.007","DOI":"10.1016\/j.tcs.2022.10.007"},{"issue":"3\u20134","key":"19_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.3233\/COM-230441","volume":"13","author":"M Anselmo","year":"2024","unstructured":"Anselmo, M., Flores, M., Madonia, M.: Computing the index of non-isometric $$k$$-ary words with Hamming and Lee distance. Comput. IOS Press 13(3\u20134), 199\u2013222 (2024). https:\/\/doi.org\/10.3233\/COM-230441","journal-title":"Comput. IOS Press"},{"key":"19_CR8","doi-asserted-by":"publisher","unstructured":"Anselmo, M., Flores, M., Madonia, M.: Density of k-ary words with 0, 1, 2 - error overlaps. Theor. Comput. Sci. 1025, 114958 (2025). https:\/\/doi.org\/10.1016\/j.tcs.2024.114958","DOI":"10.1016\/j.tcs.2024.114958"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-030-62536-8_2","volume-title":"Descriptional Complexity of Formal Systems","author":"M Anselmo","year":"2020","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M., Selmi, C.: Bad pictures: some structural properties related to overlaps. In: Jir\u00e1skov\u00e1, G., Pighizzini, G. (eds.) DCFS 2020. LNCS, vol. 12442, pp. 13\u201325. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-62536-8_2"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Azarija, J., Klav\u017ear, S., Lee, J., Pantone, J., Rho, Y.: On isomorphism classes of generalized Fibonacci cubes. Eur. J. Comb. 51, 372\u2013379 (2016). https:\/\/doi.org\/10.1016\/j.ejc.2015.05.011","DOI":"10.1016\/j.ejc.2015.05.011"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Barton, C., H\u00e9liou, A., Mouchard, L., Pissis, S.P.: Linear-time computation of minimal absent words using suffix array. BMC Bioinform. 15, 388 (2014). https:\/\/doi.org\/10.1186\/s12859-014-0388-9","DOI":"10.1186\/s12859-014-0388-9"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.tcs.2022.08.032","volume":"933","author":"M-P B\u00e9al","year":"2022","unstructured":"B\u00e9al, M.-P., Crochemore, M.: Checking whether a word is Hamming-isometric in linear time. Theor. Comput. Sci. 933, 55\u201359 (2022). https:\/\/doi.org\/10.1016\/j.tcs.2022.08.032","journal-title":"Theor. Comput. Sci."},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/3-540-60922-9_45","volume-title":"STACS 96","author":"M-P B\u00e9al","year":"1996","unstructured":"B\u00e9al, M.-P., Mignosi, F., Restivo, A.: Minimal forbidden words and symbolic dynamics. In: Puech, C., Reischuk, R. (eds.) STACS 1996. LNCS, vol. 1046, pp. 555\u2013566. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-60922-9_45"},{"key":"19_CR14","doi-asserted-by":"publisher","unstructured":"Castiglione, G., Flores, M., Giammarresi, D.: Isometric words and edit distance: main notions and new variations. In: Cellular Automata and Discrete Complex Systems. AUTOMATA 2023, volume 14152 of Lecture Notes Computer Science, pp. 6\u201313. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-42250-8.1","DOI":"10.1007\/978-3-031-42250-8.1"},{"key":"19_CR15","unstructured":"Castiglione, G., Mantaci, S., Pizzuto, S.L., Restivo, A.: A comparison between similarity measures based on minimal absent words: an experimental approach. In: Ugo de\u2019Liguoro, Matteo Palazzo, and Luca Roversi, editors, Proceedings of the 25th Italian Conference on Theoretical Computer Science, Torino, Italy, September 11\u201313, 2024, CEUR Workshop Proceedings, pp. 95\u2013105. CEUR-WS.org (2024). https:\/\/ceurws.org\/Vol-3811\/paper140.pdf"},{"issue":"1\u20134","key":"19_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.3233\/FI-2020-1874","volume":"171","author":"G Castiglione","year":"2020","unstructured":"Castiglione, G., Mantaci, S., Restivo, A.: Some investigations on similarity measures based on absent words. Fundam. Informaticae 171(1\u20134), 97\u2013112 (2020). https:\/\/doi.org\/10.3233\/FI-2020-1874","journal-title":"Fundam. Informaticae"},{"key":"19_CR17","doi-asserted-by":"publisher","unstructured":"Chairungsee, S., Crochemore, M.: Using minimal absent words to build phylogeny. Theor. Comput. Sci. 450, 109\u2013116 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.04.031","DOI":"10.1016\/j.tcs.2012.04.031"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"Crochemore, M., Mignosi, F., Restivo, A.: Automata and forbidden words. Inf. Process. Lett. 67(3), 111\u2013117 (1998). https:\/\/doi.org\/10.1016\/S0020-0190(98)00104-5","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"19_CR19","unstructured":"Epifanio, C., Forlizzi, L., Marzi, F., Mignosi, F., Placidi, G., Spezialetti, M.: On the k-Hamming and k-edit distances. In: ICTCS\u20192023 Italian Conference on Theoretical Computer Science, volume 3587 of CEUR Workshop Proceedings, pp. 143\u2013156 (2023). https:\/\/ceur-ws.org\/Vol-3587\/8136.pdf"},{"key":"19_CR20","doi-asserted-by":"publisher","unstructured":"Ili\u0107, A., Klav\u017ear, S., Rho, Y.: The index of a binary word. Theor. Comput. Sci. 452, 100\u2013106 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2012.05.025","DOI":"10.1016\/j.tcs.2012.05.025"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Klav\u017ear, S., Shpectorov, S.V.: Asymptotic number of isometric generalized Fibonacci cubes. Eur. J. Comb. 33(2), 220\u2013226 (2012). https:\/\/doi.org\/10.1016\/j.ejc.2011.10.001","DOI":"10.1016\/j.ejc.2011.10.001"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Pinho, A.J., Ferreira, P.J.S.G., Garcia, S.P., Rodrigues, J.M.O.S.: On finding minimal absent words. BMC Bioinform. 10 (2009). https:\/\/doi.org\/10.1186\/1471-2105-10-137","DOI":"10.1186\/1471-2105-10-137"},{"key":"19_CR23","doi-asserted-by":"publisher","unstructured":"Wei, J.: The structures of bad words. Eur. J. Comb. 59, 204\u2013214 (2017). https:\/\/doi.org\/10.1016\/j.ejc.2016.05.003","DOI":"10.1016\/j.ejc.2016.05.003"},{"key":"19_CR24","doi-asserted-by":"publisher","unstructured":"Wei, J.: Proof of a conjecture on 2-isometric words. Theor. Comput. Sci. 855, 68\u201373 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.11.026","DOI":"10.1016\/j.tcs.2020.11.026"},{"key":"19_CR25","doi-asserted-by":"publisher","unstructured":"Wei, J., Yang, Y., Zhu, X.: A characterization of non-isometric binary words. Eur. J. Comb. 78, 121\u2013133 (2019). https:\/\/doi.org\/10.1016\/j.ejc.2019.02.001","DOI":"10.1016\/j.ejc.2019.02.001"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Wei, J., Zhang, H.: Proofs of two conjectures on generalized Fibonacci cubes. Eur. J. Comb. 51, 419\u2013432 (2016). https:\/\/doi.org\/10.1016\/j.ejc.2015.07.018","DOI":"10.1016\/j.ejc.2015.07.018"}],"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-28404-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T23:20:51Z","timestamp":1780701651000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-28404-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032284037","9783032284044"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-28404-4_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"6 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"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":"Rouen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dlt2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/dlt-ncma-2026.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}