1 citations · 2 across the 10 of their papers we have counts for
10 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…
Watson-Crick strong bi-catenation on words
Kalpana Mahalingam
In this paper we define and investigate the binary word operation of strong--bi-catenation (denoted by ) where is either a morphic or an antimorphic invo…
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…
Counting scattered palindromes in a finite word
Kalpana Mahalingam, Palak Pandoh
We investigate the scattered palindromic subwords in a finite word. We start by characterizing the words with the least number of scattered palindromic subwords. Then, we give an u…
Generalized Circular One-Way Jumping Finite Automata
Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan
A discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite auto…
Generalized Linear One-Way Jumping Finite Automata
Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan
A new discontinuous model of computation called one-way jumping finite automata was defined by H. Chigahara et. al. This model was a restricted version of the model jumping finite…
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. $θ…
Palindromes in two-dimensional Words
Kalpana Mahalingam, Palak Pandoh
A two-dimensional (D) word is a D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are D palindromes. We study some combinat…
Label Languages of 8-directional Array P System
William Suresh Kumar, Kalpana Mahalingam, Raghavan Rama
An 8-directional array P system is one where the rewriting of an array can happen in any 8-directions. The array rules of such a system are labelled thus resulting in a labelled 8-…