Search

Your search keyword '"Mahalingam, Kalpana"' showing total 173 results
Start Over Author "Mahalingam, Kalpana"
173 results on '"Mahalingam, Kalpana"'

1. Rich Words in the Block Reversal of a Word

Author

Mahalingam, Kalpana, Maity, Anuran, and Pandoh, Palak

Subjects
Mathematics - Combinatorics, 68R15, 68R01, 68R05
Abstract

The block reversal of a word $w$, denoted by $\mathtt{BR}(w)$, is a generalization of the concept of the reversal of a word, obtained by concatenating the blocks of the word in the reverse order. We characterize non-binary and binary words whose block reversal contains only rich words. We prove that for a binary word $w$, richness of all elements of $\mathtt{BR}(w)$ depends on $l(w)$, the length of the run sequence of $w$. We show that if all elements of $\mathtt{BR}(w)$ are rich, then $2\leq l(w)\leq 8$. We also provide the structure of such words.

Published
2023

2. Properties of m-Bonacci Words

Author

Mahalingam, Kalpana, Rajendran, Helda Princy, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Giri, Debasis, editor, Vaidya, Jaideep, editor, Ponnusamy, S., editor, Lin, Zhiqiang, editor, Joshi, Karuna Pande, editor, and Yegnanarayanan, V., editor

Published
2024
Full Text
View/download PDF

3. Watson-Crick conjugates of words and languages

Author

Mahalingam, Kalpana and Maity, Anuran

Subjects
Computer Science - Formal Languages and Automata Theory, Mathematics - Combinatorics
Abstract

This paper explores the concept of Watson-Crick conjugates, also known as $\theta$-conjugates, of words and languages. This concept extends the classical idea of conjugates by incorporating the Watson-Crick complementarity of DNA sequences, from the perspective of DNA computing. Our investigation initially focuses on the properties of $\theta$-conjugates of words. We then define $\theta$-conjugates of a language and study closure properties of certain families of languages under the $\theta$-conjugate operation. Furthermore, we analyze the iterated $\theta$-conjugate of both words and languages. Finally, we delve into the idea of $\theta$-conjugate-free languages and examine the decidability problems surrounding $\theta$-conjugate-freeness for different classes of languages

Published
2022

4. Counting scattered palindromes in a finite word

Author

Mahalingam, Kalpana and Pandoh, Palak

Subjects
Computer Science - Discrete Mathematics
Abstract

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 upper bound for the total number of palindromic subwords in a word of length $n$ in terms of Fibonacci number $F_n$ by proving that at most $F_n$ new scattered palindromic subwords can be created on the concatenation of a letter to a word of length $n-1$. We propose a conjecture on the maximum number of scattered palindromic subwords in a word of length $n$ with $q$ distinct letters. We support the conjecture by showing its validity for words where $q\geq \frac{n}{2}$.

Published
2021

5. Generalized Circular One-Way Jumping Finite Automata

Author

Mishra, Ujjwal Kumar, Mahalingam, Kalpana, and Raghavan, Rama

Subjects
Computer Science - Formal Languages and Automata Theory
Abstract

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 automata. One-way jumping finite automata change their states after deleting a letter of an input and jump only in one direction. Allowing a state to delete a subword instead of a letter, we define a new model generalized circular one-way jumping finite automata. These automata work on an input in a circular manner. Similar to one-way jumping finite automata, generalized circular one-way jumping finite automata also jump only in one direction. We show that this newly defined model is powerful than one-way jumping finite automata. We define new variants(right and left) of the model generalized circular one-way jumping finite automata and compare them. We also compare the newly defined model with Chomsky hierarchy. Finally, we explore closure properties of the model., Comment: 18 pages, 4 figures. arXiv admin note: substantial text overlap with arXiv:2106.02937

Published
2021

6. Generalized Linear One-Way Jumping Finite Automata

Author

Mishra, Ujjwal Kumar, Mahalingam, Kalpana, and Raghavan, Rama

Subjects
Computer Science - Formal Languages and Automata Theory
Abstract

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 automata. These automata read an input symbol-by-symbol and jump only in one direction. A generalized linear one-way jumping finite automaton makes jumps after deleting a substring of an input string and then changes its state. These automata can make sequence of jumps in only one direction on an input string either from left to right or from right to left. We show that newly defined model is powerful than its original counterpart. We define and compare the variants, generalized right linear one-way jumping finite automata and generalized left linear one-way jumping finite automata. We also compare the newly defined models with Chomsky hierarchy. Finally, we explore closure properties of the model., Comment: 16 pages, 4 figures

Published
2021

7. Theta palindromes in theta conjugates

Author

Mahalingam, Kalpana, Pandoh, Palak, and Maity, Anuran

Subjects
Computer Science - Formal Languages and Automata Theory, Computer Science - Discrete Mathematics, 68R01, 68Q07, G.2.m
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)$., Comment: Any suggestions and comments are welcome

Published
2020
Full Text
View/download PDF

8. On m-Bonacci Intersection-Sum Graphs

Author

Mahalingam, Kalpana, Princy Rajendran, Helda, Kacprzyk, Janusz, Series Editor, Gomide, Fernando, Advisory Editor, Kaynak, Okyay, Advisory Editor, Liu, Derong, Advisory Editor, Pedrycz, Witold, Advisory Editor, Polycarpou, Marios M., Advisory Editor, Rudas, Imre J., Advisory Editor, Wang, Jun, Advisory Editor, Giri, Debasis, editor, Gollmann, Dieter, editor, Ponnusamy, S., editor, Kouichi, Sakurai, editor, Stanimirović, Predrag S., editor, and Sahoo, J. K., editor

Published
2023
Full Text
View/download PDF

9. Note on Distributivity of Different String Operations Over Language Sets

Author

Mahalingam, Kalpana, Mishra, Ujjwal Kumar, Raghavan, Rama, Ramakrishna, Viswanath, Editor-in-Chief, Ding, Zhonghai, Editor-in-Chief, SenGupta, Ashis, Editorial Board Member, Jayaram, Balasubramaniam, Editorial Board Member, Subrahmanyam, P.V., Editorial Board Member, Bapat, Ravindra B., Editorial Board Member, Subrahmanyam, P. V., editor, Vijesh, V. Antony, editor, and Veeraraghavan, Prakash, editor

Published
2023
Full Text
View/download PDF

10. Palindromes in two-dimensional Words

Author

Mahalingam, Kalpana and Pandoh, Palak

Subjects
Computer Science - Discrete Mathematics, Mathematics - Combinatorics, 68R15
Abstract

A two-dimensional ($2$D) word is a $2$D palindrome if it is equal to its reverse and it is an HV-palindrome if all its columns and rows are $1$D palindromes. We study some combinatorial and structural properties of HV-palindromes and its comparison with $2$D palindromes. We investigate the maximum number number of distinct non-empty HV-palindromic sub-arrays in any finite $2$D word, thus, proving the conjecture given by Anisiua et al. We also find the least number of HV-palindromes in an infinite $2$D word over a finite alphabet size $q$., Comment: 18 Pages. New section added. Comments and suggestions are appreciated

Published
2019

11. Watson-Crick Powers of a Word

Author

Kari, Lila, Mahalingam, Kalpana, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Poulakis, Dimitrios, editor, and Rahonis, George, editor

Published
2022
Full Text
View/download PDF

15. Label Languages of 8-directional Array P System

Author

Kumar, William Suresh, Mahalingam, Kalpana, and Rama, Raghavan

Subjects
Computer Science - Formal Languages and Automata Theory
Abstract

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-directional array P system. The labelling is not unique and the label language is obtained by recording the strings over the labels used in any terminating derivation of the P system. The system is shown to generate interesting pictures. The label language is compared with Chomsky hierarchy.

Published
2017

20. Operation Insertion on the Conjugacy and Commutativity of Words

Author

Mahalingam, Kalpana, Ravi, Hirapra, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Martín-Vide, Carlos, editor, Pond, Geoffrey, editor, and Vega-Rodríguez, Miguel A., editor

Published
2019
Full Text
View/download PDF

21. Watson-Crick Jumping Finite Automata

Author

Mahalingam, Kalpana, Raghavan, Rama, Mishra, Ujjwal Kumar, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Gopal, T.V., editor, and Watada, Junzo, editor

Published
2019
Full Text
View/download PDF

22. Combinatorial Properties of Fibonacci Arrays

Author

Kulkarni, Manasi S., Mahalingam, Kalpana, Mohankumar, Sivasankar, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Pandu Rangan, C., Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Gopal, T.V., editor, and Watada, Junzo, editor

Published
2019
Full Text
View/download PDF

23. On the Maximum Number of Distinct Palindromic Sub-arrays

Author

Mahalingam, Kalpana, Pandoh, Palak, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Martín-Vide, Carlos, editor, Okhotin, Alexander, editor, and Shapira, Dana, editor

Published
2019
Full Text
View/download PDF

24. On m-Bonacci-Sum Graphs

Author

Mahalingam, Kalpana, Rajendran, Helda Princy, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Pal, Sudebkumar Prasant, editor, and Vijayakumar, Ambat, editor

Published
2019
Full Text
View/download PDF

26. Derivation Languages of Splicing P Systems

Author

Mahalingam, Kalpana, Paul, Prithwineel, Song, Bosheng, Pan, Linqiang, Subramanian, K. G., Barbosa, Simone Diniz Junqueira, Series editor, Chen, Phoebe, Series editor, Filipe, Joaquim, Series editor, Kotenko, Igor, Series editor, Sivalingam, Krishna M., Series editor, Washio, Takashi, Series editor, Yuan, Junsong, Series editor, Zhou, Lizhu, Series editor, He, Cheng, editor, Mo, Hongwei, editor, Pan, Linqiang, editor, and Zhao, Yuxin, editor

Published
2017
Full Text
View/download PDF

27. Watson-Crick Partial Words

Author

Kulkarni, Manasi S., Mahalingam, Kalpana, Nayak, Ananda Chandra, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Martín-Vide, Carlos, editor, Neruda, Roman, editor, and Vega-Rodríguez, Miguel A., editor

Published
2017
Full Text
View/download PDF

28. Two-Dimensional Palindromes and Their Properties

Author

Kulkarni, Manasi S., Mahalingam, Kalpana, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Drewes, Frank, editor, Martín-Vide, Carlos, editor, and Truthe, Bianca, editor

Published
2017
Full Text
View/download PDF

31. Pictures and Chomsky Languages in Array P System

Author

Sureshkumar, Williams, Mahalingam, Kalpana, Rama, Raghavan, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Rozenberg, Grzegorz, editor, Salomaa, Arto, editor, Sempere, José M., editor, and Zandron, Claudio, editor

Published
2015
Full Text
View/download PDF

35. Generating DNA Code Words Using Forbidding and Enforcing Systems

Author

Genova, Daniela, Mahalingam, Kalpana, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Dediu, Adrian-Horia, editor, Martín-Vide, Carlos, editor, and Truthe, Bianca, editor

Published
2012
Full Text
View/download PDF

36. Binary Images, M −Vectors, and Ambiguity

Author

Subramanian, K. G., Mahalingam, Kalpana, Abdullah, Rosni, Nagar, Atulya K., Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Aggarwal, Jake K., editor, Barneva, Reneta P., editor, Brimkov, Valentin E., editor, Koroutchev, Kostadin N., editor, and Korutcheva, Elka R., editor

Published
2011
Full Text
View/download PDF

37. Watson-Crick Conjugate and Commutative Words

Author

Kari, Lila, Mahalingam, Kalpana, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Garzon, Max H., editor, and Yan, Hao, editor

Published
2008
Full Text
View/download PDF

38. Involution Solid Codes

Author

Kari, Lila, Mahalingam, Kalpana, Rozenberg, G., editor, Bäck, Th., editor, Eiben, A. E., editor, Kok, J. N., editor, Spaink, H. P., editor, Chen, Junghuei, editor, Jonoska, Nataša, editor, and Rozenberg, Grzegorz, editor

Published
2006
Full Text
View/download PDF

39. DNA Codes and Their Properties

Author

Kari, Lila, Mahalingam, Kalpana, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Mao, Chengde, editor, and Yokomori, Takashi, editor

Published
2006
Full Text
View/download PDF

40. Involution Solid and Join Codes

Author

Jonoska, Nataša, Kari, Lila, Mahalingam, Kalpana, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Dough, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Ibarra, Oscar H., editor, and Dang, Zhe, editor

Published
2006
Full Text
View/download PDF

43. Languages of DNA Based Code Words

Author

Jonoska, Nataša, Mahalingam, Kalpana, Goos, Gerhard, editor, Hartmanis, Juris, editor, van Leeuwen, Jan, editor, Chen, Junghuei, editor, and Reif, John, editor

Published
2004
Full Text
View/download PDF

48. Primitivity of Atom Watson-Crick Fibonacci Words

Author

Kari, Lila, Mahalingam, Kalpana, Pandoh, Palak, and Wang, Zihao

Abstract

Fibonacci strings were first defined by Knuth in his 1968 "The Art of Computer Programming", as being an infinite sequence of strings obtained from two initial letters $f_1 = a$ and $f_2= b$, by the recursive definition $f_{n+2} = f_{n+1}\cdot f_{n}$, for all positive integers $n \geq 1$, where $\cdot$ denotes word concatenation. Motivated by theoretical studies of DNA computing, several generalizations of Fibonnaci words have been proposed under the umbrella term involutive Fibonacci words. These include $\phi$-Fibonacci words and indexed $\phi$-Fibonacci words, where $\phi$ denotes either a morphic or an antimorphic involution. (In the particular case of the DNA alphabet $\Delta = \{A, C, G, T\}$, where $\phi$ is the Watson-Crick complementarity (antimorphic) involution on $\Delta^*$ that maps $A$ to $T$, $G$ to $C$, and vice versa, the $\phi$-Fibonacci words are termed atom Watson-Crick Fibonacci words.) In this paper, we investigate the properties of atom $\phi$-Fibonacci words over a four-letter alphabet, whereby atom indicates that the two initial words are singleton letters. The results are different from the case of the classical Fibonacci words over a two-letter alphabet, which are all primitive, in that for some (anti)morphic involutions, some initial letters, and some indices $n$, we have that the $n$-th atom $\phi$-Fibonacci word is primitive, while for some others it is not. In the particular case of the Watson-Crick complementarity antimorphic involution, regardless of the initial two letters in the Fibonacci recursion (different, or the same), for all $n > 3$, the $n$-th atom Watson-Crick Fibonacci word is primitive., Journal of Automata, Languages and Combinatorics, Volume 27, Numbers 1-3, 2022, 151-178

Published
2022
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results