1 citations · 2 across the 6 of their papers we have counts for
6 papers
On words that nearly -commute
Anuran Maity, Kalpana Mahalingam
The Hamming distance between two equal length words is the number of positions where and differ. For and antimorphic involution , -commutes…
Bounds on the closed-rich constant of infinite words
Anuran Maity, Svetlana Puzynina
A finite word is called \textit{closed} if it has length at most 1 or it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurr…
Mutually Abelian-Bordered Binary Words
Anuran Maity, K. V. Krishna
A word is said to be bordered if it contains a nonempty proper prefix that is also a suffix. A pair of words is said to be mutually bordered if there exists a word that is…
Rich Words in the Block Reversal of a Word
Kalpana Mahalingam, Anuran Maity, Palak Pandoh
The block reversal of a word , denoted by , is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the…
Watson-Crick conjugates of words and languages
Kalpana Mahalingam, Anuran Maity
In this work, we explore the concept of Watson-Crick conjugates, also known as -conjugates (where is an antimorphic involution), of words and languages. This concept extends…
Theta palindromes in theta conjugates
Kalpana Mahalingam, Palak Pandoh, Anuran Maity
A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping is an involution that is also an antimorphism. $θ…