{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:56:51Z","timestamp":1776859011139,"version":"3.51.2"},"reference-count":26,"publisher":"World Scientific Pub Co Pte Ltd","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:p> A two-dimensional (2D) word is a 2D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are 1D palindromes. We characterize such words and study some of their combinatorial and structural properties. We also find the number of possible palindromic conjugates of a 2D word. We investigate an upper bound on the number of distinct non-empty HV-palindromic subwords in any finite 2D word, thus, proving the conjecture given by Anisiu et al. We also identify the minimum number of HV-palindromic subwords in an infinite 2D word over a finite alphabet. <\/jats:p>","DOI":"10.1142\/s012905412250006x","type":"journal-article","created":{"date-parts":[[2022,3,1]],"date-time":"2022-03-01T01:28:29Z","timestamp":1646098109000},"page":"389-409","source":"Crossref","is-referenced-by-count":2,"title":["HV-Palindromes in Two-Dimensional Words"],"prefix":"10.1142","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2418-0512","authenticated-orcid":false,"given":"Kalpana","family":"Mahalingam","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai, 600036, India"}]},{"given":"Palak","family":"Pandoh","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology Madras, Chennai, 600036, India"}]}],"member":"219","published-online":{"date-parts":[[2022,2,26]]},"reference":[{"key":"S012905412250006XBIB001","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00212-2"},{"key":"S012905412250006XBIB002","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795298321"},{"key":"S012905412250006XBIB003","first-page":"3","volume":"6","author":"Anisiu M. C.","year":"2008","journal-title":"Annals of the Tiberiu Popoviciu Seminar of Functional Equations, Approximation and Convexity ISSN 1584-4536"},{"key":"S012905412250006XBIB004","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2009.08.002"},{"key":"S012905412250006XBIB005","first-page":"91","volume-title":"Words 2005 5th International Conference on Words","volume":"36","author":"Anne V. P. K.","year":"2005"},{"issue":"2","key":"S012905412250006XBIB006","first-page":"121","volume":"6","author":"Berth\u00e9 V.","year":"2001","journal-title":"J. Autom. Languages and Combin."},{"key":"S012905412250006XBIB007","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2006.07.009"},{"key":"S012905412250006XBIB008","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.1997.628390"},{"key":"S012905412250006XBIB009","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.02.013"},{"key":"S012905412250006XBIB010","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2017.05.001"},{"key":"S012905412250006XBIB011","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2016.09.011"},{"key":"S012905412250006XBIB012","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.03.001"},{"key":"S012905412250006XBIB013","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_4"},{"key":"S012905412250006XBIB014","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2008.04.006"},{"key":"S012905412250006XBIB016","series-title":"47 of LIPIcs. Leibniz Int. Proc. Inform.","first-page":"44:1","volume-title":"33rd Symp. Theoretical Aspects of Computer Science","author":"Holub S.","year":"2016"},{"key":"S012905412250006XBIB017","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24785-9_56"},{"key":"S012905412250006XBIB018","volume-title":"Formal Languages and Their Relation to Automata","author":"Hopcroft J. E.","year":"1969"},{"key":"S012905412250006XBIB019","doi-asserted-by":"publisher","DOI":"10.1007\/BF01182773"},{"key":"S012905412250006XBIB020","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77962-9_29"},{"key":"S012905412250006XBIB021","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-009-9131-2"},{"key":"S012905412250006XBIB022","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-53733-7_11"},{"key":"S012905412250006XBIB023","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097"},{"key":"S012905412250006XBIB024","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-13435-8_32"},{"key":"S012905412250006XBIB025","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2019.06.030"},{"key":"S012905412250006XBIB026","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-63000-3_12"},{"issue":"3","key":"S012905412250006XBIB027","first-page":"267","volume":"21","author":"Mahalingam K.","year":"2018","journal-title":"Romanian J. Inform. Sci. Technol."}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905412250006X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T04:06:49Z","timestamp":1660277209000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/10.1142\/S012905412250006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,26]]},"references-count":26,"journal-issue":{"issue":"05","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["10.1142\/S012905412250006X"],"URL":"https:\/\/doi.org\/10.1142\/s012905412250006x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,2,26]]}}}