Showing papers by "Kalpana Mahalingam published in 2020"
TL;DR: This work investigates the least number of distinct palindromic sub-arrays in two-dimensional words over a finite alphabet and discusses the case for both periodic as well as aperiodic words.
6 citations
16 Nov 2020
TL;DR: This paper introduces a new automata called Watson-Crick jumping finite automata, working on tapes which are double stranded sequences of symbols, similar to that of a Watson- Crick automata.
Abstract: In this paper, we introduce a new automata called Watson-Crick jumping finite automata, working on tapes which are double stranded sequences of symbols, similar to that of a Watson-Crick automata. This automata scans the double stranded sequence in a discontinuous manner (i.e.) after reading a double stranded string, the automata can jump over some subsequence and continue scanning, depending on the rule. We define some variants of such automata and compare the languages accepted by these variants with the language classes in Chomsky hierarchy. We also investigate some closure properties.
6 citations
TL;DR: The Parikh matrix mapping plays an important role in the study of words through numerical properties and is introduced by Egecioglu and Ibarra (2004) as an extension of the P-matrix mapping.
Abstract: The Parikh matrix mapping plays an important role in the study of words through numerical properties. The Parikh q-matrix mapping, introduced by Egecioglu and Ibarra (2004) as an extension of the P...
4 citations
TL;DR: In this article, the distribution of palindromes and WK-palindrome conjugates of a word has been studied in terms of the number of elements in the conjugate set.
Abstract: A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping $\theta$ is an involution that is also an antimorphism. $\theta$-conjugates of a word is a generalisation of conjugates of a word that incorporates the notion of WK-involution $\theta$. In this paper, we study the distribution of palindromes and Watson-Crick palindromes, also known as $\theta$-palindromes among both the set of conjugates and $\theta$-conjugates of a word $w$. We also consider some general properties of the set $C_{\theta}(w)$, i.e., the set of $\theta$-conjugates of a word $w$, and characterize words $w$ such that $|C_{\theta}(w)|=|w|+1$, i.e., with the maximum number of elements in $C_{\theta}(w)$. We also find the structure of words that have at least one (WK)-palindrome in $C_{\theta}(w)$.
2 citations
2 citations
2 citations
07 Dec 2020
TL;DR: This paper studies the distribution of palindromes and Watson-Crick palindrome among both the set of conjugates and $\theta$-conjugates of a word $w and finds the structure of words that have at least one (WK)-palindrome in $C_{\theta}(w)$.
Abstract: A DNA string is a Watson-Crick (WK) palindrome when the complement of its reverse is equal to itself. The Watson-Crick mapping \(\theta \) is an involution that is also an antimorphism. \(\theta \)-conjugates of a word is a generalization of conjugates of a word that incorporates the notion of WK-involution \(\theta \). In this paper, we study the distribution of palindromes and Watson-Crick palindromes, also known as \(\theta \)-palindromes among both the set of conjugates and \(\theta \)-conjugates of a word w. We also consider some general properties of the set \(C_{\theta }(w)\), i.e., the set of \(\theta \)-conjugates of a word w, and characterize words w such that \(|C_{\theta }(w)|=|w|+1\), i.e., with the maximum number of elements in \(C_{\theta }(w)\). We also find the structure of words that have at least one (WK)-palindrome in \(C_{\theta }(w)\).
1 citations