{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T18:36:22Z","timestamp":1770921382183,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032178008","type":"print"},{"value":"9783032178015","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-17801-5_6","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:52:55Z","timestamp":1770918775000},"page":"75-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Mutually Abelian-Bordered Binary Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9215-1388","authenticated-orcid":false,"given":"Anuran","family":"Maity","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0795-1346","authenticated-orcid":false,"given":"K. V.","family":"Krishna","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"6_CR1","unstructured":"Aberkane, A., Currie, J.D.,\u00a0Rampersad, N.: The number of ternary words avoiding abelian cubes grows exponentially. J. Integer Seq. 7(2), 04.2.7, 13 (2004)"},{"issue":"2","key":"6_CR2","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s00224-015-9629-1","volume":"59","author":"S Avgustinovich","year":"2016","unstructured":"Avgustinovich, S., Puzynina, S.: Weak abelian periodicity of infinite words. Theory Comput. Syst. 59(2), 161\u2013179 (2016)","journal-title":"Theory Comput. Syst."},{"issue":"03\u201304","key":"6_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1142\/S0129054122410027","volume":"33","author":"F Blanchet-Sadri","year":"2022","unstructured":"Blanchet-Sadri, F., Chen, K., Hawes, K.: Dyck words, lattice paths, and abelian borders. Int. J. Found. Comput. Sci. 33(03\u201304), 203\u2013226 (2022)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"1\u20133","key":"6_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(97)88002-X","volume":"81","author":"A Carpi","year":"1998","unstructured":"Carpi, A.: On the number of abelian square-free words on four letters. Disc. Appl. Math. 81(1\u20133), 155\u2013167 (1998)","journal-title":"Disc. Appl. Math."},{"issue":"04","key":"6_CR5","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1142\/S0129054111008489","volume":"22","author":"J Cassaigne","year":"2011","unstructured":"Cassaigne, J., Richomme, G., Saari, K., Zamboni, L.Q.: Avoiding abelian powers in binary words with bounded abelian complexity. Int. J. Found. Comput. Sci. 22(04), 905\u2013920 (2011)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ejc.2015.07.003","volume":"51","author":"E Charlier","year":"2016","unstructured":"Charlier, E., Harju, T., Puzynina, S., Zamboni, L.Q.: Abelian bordered factors and periodicity. Eur. J. Comb. 51, 407\u2013418 (2016)","journal-title":"Eur. J. Comb."},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.dam.2014.02.012","volume":"171","author":"M Christodoulakis","year":"2014","unstructured":"Christodoulakis, M., Christou, M., Crochemore, M., Iliopoulos, C.S.: Abelian borders in binary words. Disc. Appl. Math. 171, 141\u2013146 (2014)","journal-title":"Disc. Appl. Math."},{"issue":"4","key":"6_CR8","doi-asserted-by":"publisher","first-page":"696","DOI":"10.4153\/CJM-2001-028-4","volume":"53","author":"J Currie","year":"2001","unstructured":"Currie, J., Linek, V.: Avoiding patterns in the abelian sense. Can. J. Math. 53(4), 696\u2013714 (2001)","journal-title":"Can. J. Math."},{"issue":"5","key":"6_CR9","doi-asserted-by":"publisher","first-page":"942","DOI":"10.1016\/j.jcta.2012.01.006","volume":"119","author":"JD Currie","year":"2012","unstructured":"Currie, J.D., Rampersad, N.: Fixed points avoiding abelian k-powers. J. Comb. Theory Ser. A 119(5), 942\u2013948 (2012)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"3","key":"6_CR10","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.tcs.2008.08.039","volume":"409","author":"JD Currie","year":"2008","unstructured":"Currie, J.D., Visentin, T.I.: Long binary patterns are abelian 2-avoidable. Theor. Comput. Sci. 409(3), 432\u2013437 (2008)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"6_CR11","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.: Periodicity and unbordered segments of words. Disc. Math. 26(2), 101\u2013109 (1979)","journal-title":"Disc. Math."},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.tcs.2017.02.012","volume":"684","author":"G Fici","year":"2017","unstructured":"Fici, G., Mignosi, F., Shallit, J.: Abelian-square-rich words. Theor. Comput. Sci. 684, 29\u201342 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.aam.2019.04.001","volume":"108","author":"G Fici","year":"2019","unstructured":"Fici, G., Postic, M., Silva, M.: Abelian antipowers in infinite words. Adv. Appl. Math. 108, 67\u201378 (2019)","journal-title":"Adv. Appl. Math."},{"issue":"10","key":"6_CR14","doi-asserted-by":"publisher","first-page":"6888","DOI":"10.1109\/TIT.2022.3167935","volume":"68","author":"D Gabric","year":"2022","unstructured":"Gabric, D.: Mutual borders and overlaps. IEEE Trans. Inf. Theory 68(10), 6888\u20136893 (2022)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"6_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jcta.1996.0047","volume":"74","author":"I Gessel","year":"1996","unstructured":"Gessel, I., Goddard, W., Shur, W., Wilf, H.S., Yen, L.: Counting pairs of lattice paths by intersections. J. Comb. Theory Ser. A 74(2), 173\u2013187 (1996)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"6_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1016\/0097-3165(81)90038-8","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: Periods in strings. J. Comb. Theory Ser. A 30(1), 19\u201342 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"6_CR17","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0097-3165(81)90005-4","volume":"30","author":"LJ Guibas","year":"1981","unstructured":"Guibas, L.J., Odlyzko, A.M.: String overlaps, pattern matching, and nontransitive games. J. Comb. Theory Ser. A 30(2), 183\u2013208 (1981)","journal-title":"J. Comb. Theory Ser. A"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.jcta.2004.07.009","volume":"108","author":"T Harju","year":"2004","unstructured":"Harju, T., Nowotka, D.: Border correlation of binary words. J. Comb. Theory Ser. A 108(2), 331\u2013341 (2004)","journal-title":"J. Comb. Theory Ser. A"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-24749-4_26","volume-title":"STACS 2004","author":"T Harju","year":"2004","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 294\u2013304. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_26"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"Holub, \u0160., M\u00fcller, M.: Fully bordered words. Theor. Comput. Sci. 684, 53\u201358 (2017)","DOI":"10.1016\/j.tcs.2016.10.020"},{"key":"6_CR21","series-title":"Cambridge Mathematical Library","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Combinatorics on words. Cambridge Mathematical Library, Cambridge University Press, Cambridge (1997)"},{"key":"6_CR22","unstructured":"Maity, A., Krishna, K.V.: Mutually abelian-bordered binary words. arXiv preprint arXiv:2509.20773 (2025)"},{"issue":"5","key":"6_CR23","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"19","author":"P Nielsen","year":"1973","unstructured":"Nielsen, P.: A note on bifix-free sequences (corresp.). IEEE Trans. Inf. Theory 19(5), 704\u2013706 (1973)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"6_CR24","doi-asserted-by":"publisher","DOI":"10.1016\/j.aam.2020.102095","volume":"121","author":"J Peltom\u00e4ki","year":"2020","unstructured":"Peltom\u00e4ki, J., Whiteland, M.A.: Avoiding abelian powers cyclically. Adv. Appl. Math. 121, 102095 (2020)","journal-title":"Adv. Appl. Math."},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/978-3-642-38771-5_37","volume-title":"Developments in Language Theory","author":"N Rampersad","year":"2013","unstructured":"Rampersad, N., Rigo, M., Salimov, P.: On the number of abelian bordered words. In: B\u00e9al, M.-P., Carton, O. (eds.) DLT 2013. LNCS, vol. 7907, pp. 420\u2013432. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38771-5_37"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Richmond, L.B.,\u00a0Shallit, J.: Counting abelian squares. Electron. J. Comb. 16(1) (2009)","DOI":"10.37236\/161"},{"key":"6_CR27","doi-asserted-by":"publisher","unstructured":"Rivals, E.,\u00a0Wang, P.: Counting overlapping pairs of words. In: International Computing and Combinatorics Conference, pp. 381\u2013395. Springer, Heidelberg (2025). https:\/\/doi.org\/10.1007\/978-981-95-0218-9_28","DOI":"10.1007\/978-981-95-0218-9_28"}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2026: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17801-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T17:52:57Z","timestamp":1770918777000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17801-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032178008","9783032178015"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17801-5_6","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":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Krakow","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":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"51","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sofsem.uj.edu.pl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}