{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T04:09:22Z","timestamp":1751342962335,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031970993","type":"print"},{"value":"9783031971006","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-97100-6_1","type":"book-chapter","created":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:46Z","timestamp":1751292526000},"page":"1-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fibonacci Pictures on\u00a0a\u00a0Binary Alphabet"],"prefix":"10.1007","author":[{"given":"Marcella","family":"Anselmo","sequence":"first","affiliation":[]},{"given":"Dora","family":"Giammarresi","sequence":"additional","affiliation":[]},{"given":"Maria","family":"Madonia","sequence":"additional","affiliation":[]},{"given":"Carla","family":"Selmi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,6,29]]},"reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-21254-3_7","volume-title":"Language and Automata Theory and Applications","author":"M Anselmo","year":"2011","unstructured":"Anselmo, M., Giammarresi, D., Madonia, M.: Classification of string languages via tiling recognizable picture languages. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 105\u2013116. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21254-3_7"},{"key":"1_CR2","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"},{"issue":"1\u20132","key":"1_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/S0304-3975(98)00182-0","volume":"237","author":"A Apostolico","year":"2000","unstructured":"Apostolico, A., Brimkov, V.E.: Fibonacci arrays and their two-dimensional repetitions. Theor. Comput. Sci. 237(1\u20132), 263\u2013273 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Fibonacci Words \u2014 A Survey, pp. 13\u201327. Springer Berlin Heidelberg, Berlin, Heidelberg (1986)","DOI":"10.1007\/978-3-642-95486-3_2"},{"issue":"1\u20132","key":"1_CR5","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0304-3975(00)00441-2","volume":"273","author":"V Berth\u00e9","year":"2002","unstructured":"Berth\u00e9, V., Tijdeman, R.: Balance properties of multi-dimensional words. Theor. Comput. Sci. 273(1\u20132), 197\u2013224 (2002). https:\/\/doi.org\/10.1016\/S0304-3975(00)00441-2","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"179","DOI":"10.5802\/jtnb.274","volume":"12","author":"V Berth\u00e9","year":"2000","unstructured":"Berth\u00e9, V., Vuillon, L.: Suites doubles de basse complexit\u00e9. Journal de Th\u00e9orie des Nombres de Bordeaux 12(1), 179\u2013208 (2000)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Berth\u00e9, V., Vuillon, L.: Palindromes and two-dimensional sturmian sequences. J. Autom. Lang. Comb. 6(2), 121\u2013138 (2001). https:\/\/doi.org\/10.25596\/JALC-2001-121","DOI":"10.25596\/JALC-2001-121"},{"issue":"3","key":"1_CR8","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/j.tcs.2005.08.033","volume":"349","author":"W Chuan","year":"2005","unstructured":"Chuan, W., Ho, H.: Locating factors of the infinite Fibonacci word. Theor. Comput. Sci. 349(3), 429\u2013442 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"1828","DOI":"10.1016\/j.jcss.2011.12.005","volume":"78","author":"M Crochemore","year":"2012","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: The maximal number of cubic runs in a word. J. Comput. Syst. Sci. 78, 1828\u20131836 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2013.11.018","volume":"521","author":"M Crochemore","year":"2014","unstructured":"Crochemore, M., Iliopoulos, C.S., Kubica, M., Radoszewski, J., Rytter, W., Walen, T.: Extracting powers and periods in a word from its runs structure. Theor. Comput. Sci. 521, 29\u201341 (2014)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Giammarresi, D., Restivo, A.: Two-dimensional languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Volume 3: Beyond Words, pp. 215\u2013267. Springer (1997)","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: 40th Annual Symposium on Foundations of Computer Science FOCS \u201999, pp. 596\u2013604. IEEE Computer Society, New York, NY, USA (1999)","DOI":"10.1109\/SFFCS.1999.814634"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kolpakov, R.M., Kucherov, G.: On maximal repetitions in words. In: Ciobanu, G., Paun, G. (eds.) Fundamentals of Computation Theory, 12th International Symposium, FCT \u201999, Proceedings. Lecture Notes in Computer Science, vol.\u00a01684, pp. 374\u2013385. Springer (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1006\/inco.1997.2659","volume":"138","author":"M Latteux","year":"1997","unstructured":"Latteux, M., Simplot, D.: Context-sensitive string languages and recognizable picture languages. Inf. Comput. 138(2), 160\u2013169 (1997)","journal-title":"Inf. Comput."},{"key":"1_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on words, 2nd edn. Cambridge University Press, Cambridge mathematical library (1997)","edition":"2"},{"key":"1_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2024.115005","volume":"1026","author":"S Marcus","year":"2025","unstructured":"Marcus, S., Sokol, D., Zelikovitz, S.: Exact and inexact search for 2D side-sharing tandems. Theor. Comput. Sci. 1026, 115005 (2025)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Mignosi, F., Pirillo, G.: Repetitions in the Fibonacci infinite word. RAIRO-Inf. Theor. et Applic. 26\u2013n.3, 199\u2013204 (1992)","DOI":"10.1051\/ita\/1992260301991"},{"key":"1_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2023.102553","volume":"149","author":"S Mohankumar","year":"2023","unstructured":"Mohankumar, S., Raghavan, R.: Two-dimensional Fibonacci words: tandem repeats and factor complexity. Adv. Appl. Math. 149, 102553 (2023)","journal-title":"Adv. Appl. Math."},{"issue":"1\u20133","key":"1_CR19","first-page":"201","volume":"28","author":"TJ Smith","year":"2023","unstructured":"Smith, T.J., Salomaa, K.: Recognition and complexity results for projection languages of two-dimensional automata. J. Autom. Lang. Comb. 28(1\u20133), 201\u2013220 (2023)","journal-title":"J. Autom. Lang. Comb."}],"container-title":["Lecture Notes in Computer Science","Descriptional Complexity of Formal Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97100-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T14:08:48Z","timestamp":1751292528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97100-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031970993","9783031971006"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97100-6_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"29 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCFS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Descriptional Complexity of Formal Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Loughborough","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"22 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dcfs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.lboro.ac.uk\/departments\/compsci\/events\/dcfs-2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}