5 papers
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…
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-…