default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKalpana Mahalingam
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j34]Kalpana Mahalingam, Anuran Maity, Palak Pandoh
:
Rich words in the block reversal of a word. Discret. Appl. Math. 334: 127-138 (2023)- 2022
- [j33]Ujjwal Kumar Mishra, Kalpana Mahalingam, Raghavan Rama:
Watson-Crick Jumping Finite Automata: Combination, Comparison and Closure. Comput. J. 65(5): 1178-1188 (2022) - [j32]Kalpana Mahalingam, Helda Princy Rajendran:
Properties of m-bonacci-sum graphs. Discret. Appl. Math. 319: 149-158 (2022) - [j31]Kalpana Mahalingam, Anuran Maity, Palak Pandoh:
Counting (Watson-Crick) palindromes in Watson-Crick conjugates. Inf. Comput. 285(Part): 104863 (2022) - [j30]Kalpana Mahalingam, Palak Pandoh:
Enumeration of two dimensional palindromes. Inf. Comput. 286: 104781 (2022) - [j29]Kalpana Mahalingam, Palak Pandoh:
HV-Palindromes in Two-Dimensional Words. Int. J. Found. Comput. Sci. 33(5): 389-409 (2022) - [j28]Lila Kari, Kalpana Mahalingam, Palak Pandoh, Zihao Wang:
Primitivity of Atom Watson-Crick Fibonacci Words. J. Autom. Lang. Comb. 27(1-3): 151-178 (2022) - [c23]Lila Kari, Kalpana Mahalingam:
Watson-Crick Powers of a Word. CAI 2022: 136-148 - [i7]Kalpana Mahalingam, Anuran Maity:
Watson-Crick conjugates of words and languages. CoRR abs/2208.03123 (2022) - 2021
- [j27]Kalpana Mahalingam, Helda Princy Rajendran:
m-Bonacci graceful labeling. AKCE Int. J. Graphs Comb. 18(1): 7-15 (2021) - [j26]Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam, Zihao Wang:
Involutive Fibonacci Words. J. Autom. Lang. Comb. 26(3-4): 255-280 (2021) - [j25]Kalpana Mahalingam, Prithwineel Paul:
Time Varying Splicing Recognizers. SN Comput. Sci. 2(1): 56 (2021) - [j24]Kalpana Mahalingam, Anuran Maity, Palak Pandoh, Rama Raghavan:
Block reversal on finite words. Theor. Comput. Sci. 894: 135-151 (2021) - [i6]Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan:
Generalized Linear One-Way Jumping Finite Automata. CoRR abs/2106.02937 (2021) - [i5]Ujjwal Kumar Mishra, Kalpana Mahalingam, Rama Raghavan:
Generalized Circular One-Way Jumping Finite Automata. CoRR abs/2106.03852 (2021) - [i4]Kalpana Mahalingam, Palak Pandoh:
Counting scattered palindromes in a finite word. CoRR abs/2108.02729 (2021) - 2020
- [j23]Somnath Bera, Kalpana Mahalingam:
On Commuting Parikh q-Matrices. Fundam. Informaticae 172(4): 327-341 (2020) - [j22]Somnath Bera, Rodica Ceterchi, Kalpana Mahalingam, K. G. Subramanian:
Parikh q-Matrices and q-Ambiguous Words. Int. J. Found. Comput. Sci. 31(1): 23-36 (2020) - [j21]Kalpana Mahalingam, Ujjwal Kumar Mishra, Rama Raghavan:
Watson-Crick Jumping Finite Automata. Int. J. Found. Comput. Sci. 31(7): 891-913 (2020) - [j20]Kalpana Mahalingam, Prithwineel Paul:
On Szilard Languages of InsDel Systems. J. Autom. Lang. Comb. 25(4): 321-348 (2020) - [j19]Kalpana Mahalingam, Palak Pandoh, Kamala Krithivasan:
On the least number of palindromes in two-dimensional words. Theor. Comput. Sci. 807: 245-256 (2020) - [c22]Kalpana Mahalingam, Palak Pandoh, Anuran Maity:
Theta Palindromes in Theta Conjugates. TPNC 2020: 145-156 - [i3]Kalpana Mahalingam, Palak Pandoh, Anuran Maity:
Theta palindromes in theta conjugates. CoRR abs/2008.00255 (2020)
2010 – 2019
- 2019
- [c21]Kalpana Mahalingam, Helda Princy Rajendran:
On m-Bonacci-Sum Graphs. CALDAM 2019: 65-76 - [c20]Kalpana Mahalingam, Palak Pandoh:
On the Maximum Number of Distinct Palindromic Sub-arrays. LATA 2019: 434-446 - [c19]Manasi S. Kulkarni, Kalpana Mahalingam, Sivasankar Mohankumar:
Combinatorial Properties of Fibonacci Arrays. TAMC 2019: 448-466 - [c18]Kalpana Mahalingam, Rama Raghavan, Ujjwal Kumar Mishra:
Watson-Crick Jumping Finite Automata. TAMC 2019: 467-480 - [c17]Kalpana Mahalingam, Hirapra Ravi:
Operation Insertion on the Conjugacy and Commutativity of Words. TPNC 2019: 70-81 - [i2]Kalpana Mahalingam, Palak Pandoh:
Palindromes in two-dimensional Words. CoRR abs/1904.11334 (2019) - 2018
- [j18]Kalpana Mahalingam, Prithwineel Paul, Erkki Mäkinen:
On Derivation Languages of a Class of Splicing Systems. Acta Cybern. 23(4): 981-993 (2018) - [j17]Somnath Bera, Kalpana Mahalingam, K. G. Subramanian:
Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator. Int. J. Found. Comput. Sci. 29(3): 403-414 (2018) - [j16]Williams Sureshkumar, Kalpana Mahalingam, Raghavan Rama:
Labelled graph rules in P systems. Iran J. Comput. Sci. 1(3): 133-145 (2018) - [j15]Lila Kari, Manasi S. Kulkarni, Kalpana Mahalingam:
Relative Watson-Crick Primitivity of Words. J. Autom. Lang. Comb. 23(1-3): 201-217 (2018) - 2017
- [c16]Kalpana Mahalingam, Prithwineel Paul, Bosheng Song, Linqiang Pan, K. G. Subramanian:
Derivation Languages of Splicing P Systems. BIC-TA 2017: 487-501 - [c15]Manasi S. Kulkarni, Kalpana Mahalingam:
Two-Dimensional Palindromes and Their Properties. LATA 2017: 155-167 - [c14]Manasi S. Kulkarni, Kalpana Mahalingam, Ananda Chandra Nayak:
Watson-Crick Partial Words. TPNC 2017: 190-202 - [i1]Williams Sureshkumar, Kalpana Mahalingam, Raghavan Rama:
Label Languages of 8-directional Array P System. CoRR abs/1712.09791 (2017) - 2016
- [j14]Somnath Bera, Kalpana Mahalingam:
Some Algebraic Aspects of Parikh q-Matrices. Int. J. Found. Comput. Sci. 27(4): 479-500 (2016) - [j13]Somnath Bera, Kalpana Mahalingam:
Structural Properties of Word Representable Graphs. Math. Comput. Sci. 10(2): 209-222 (2016) - 2015
- [c13]Williams Sureshkumar, Kalpana Mahalingam, Raghavan Rama:
Pictures and Chomsky Languages in Array P System. Int. Conf. on Membrane Computing 2015: 277-289 - 2014
- [c12]Adrian Atanasiu, Kalpana Mahalingam, K. G. Subramanian:
Morphisms and Weak-Ratio Property. Discrete Mathematics and Computer Science 2014: 13-21 - 2013
- [j12]K. G. Subramanian, Kalpana Mahalingam, Rosni Abdullah, Atulya K. Nagar:
Two-Dimensional Digitized Picture Arrays and Parikh Matrices. Int. J. Found. Comput. Sci. 24(3): 393-408 (2013) - 2012
- [j11]Kalpana Mahalingam, K. G. Subramanian:
Product of Parikh Matrices and Commutativity. Int. J. Found. Comput. Sci. 23(1): 207-223 (2012) - [j10]Mark Daley, Helmut Jürgensen, Lila Kari, Kalpana Mahalingam:
Relativized codes. Theor. Comput. Sci. 429: 54-64 (2012) - [c11]Daniela Genova, Kalpana Mahalingam:
Generating DNA Code Words Using Forbidding and Enforcing Systems. TPNC 2012: 147-160 - 2011
- [j9]Mark Daley, Ian McQuillan, James M. McQuillan, Kalpana Mahalingam:
Theoretical and computational properties of transpositions. Nat. Comput. 10(2): 795-804 (2011) - [c10]K. G. Subramanian, Ibrahim Venkat, Kalpana Mahalingam:
Context-Free Systems with a Complementarity Relation. BIC-TA 2011: 194-198 - [c9]K. G. Subramanian, Kalpana Mahalingam, Rosni Abdullah, Atulya K. Nagar:
Binary Images, M -Vectors, and Ambiguity. IWCIA 2011: 248-260 - 2010
- [j8]Lila Kari, Kalpana Mahalingam:
Watson-Crick palindromes in DNA computing. Nat. Comput. 9(2): 297-316 (2010) - [j7]Mark Daley, Kalpana Mahalingam:
A relation by palindromic subwords. Nat. Comput. 9(4): 935-954 (2010) - [c8]Kalpana Mahalingam, K. G. Subramanian:
Palindromic completion of a word. BIC-TA 2010: 1459-1465
2000 – 2009
- 2009
- [j6]Lila Kari, Kalpana Mahalingam, Shinnosuke Seki:
Twin-roots of words and their properties. Theor. Comput. Sci. 410(24-25): 2393-2400 (2009) - 2008
- [j5]Natasa Jonoska, Lila Kari, Kalpana Mahalingam:
Involution Solid and Join codes. Fundam. Informaticae 86(1-2): 127-142 (2008) - [j4]Lila Kari, Kalpana Mahalingam:
Watson-Crick Bordered Words and their Syntactic Monoid. Int. J. Found. Comput. Sci. 19(5): 1163-1179 (2008) - 2007
- [j3]Lila Kari, Kalpana Mahalingam, Gabriel Thierrin:
The syntactic monoid of hairpin-free languages. Acta Informatica 44(3-4): 153-166 (2007) - [j2]Lila Kari, Kalpana Mahalingam:
Involutively Bordered Words. Int. J. Found. Comput. Sci. 18(5): 1089-1106 (2007) - [c7]Lila Kari, Kalpana Mahalingam:
Watson-Crick Conjugate and Commutative Words. DNA 2007: 273-283 - 2006
- [c6]Natasa Jonoska, Lila Kari, Kalpana Mahalingam:
Involution Solid and Join Codes. Developments in Language Theory 2006: 192-202 - [c5]Lila Kari, Kalpana Mahalingam:
DNA Codes and Their Properties. DNA 2006: 127-142 - [c4]Lila Kari, Kalpana Mahalingam:
Involution Solid Codes. Nanotechnology: Science and Computation 2006: 137-146 - 2005
- [j1]Natasa Jonoska, Kalpana Mahalingam, Junghuei Chen:
Involution codes: with application to DNA coded languages. Nat. Comput. 4(2): 141-162 (2005) - 2004
- [b1]Kalpana Mahalingam:
Involution Codes with Application to DNA Strand Design. University of South Florida, Tampa, USA, 2004 - [c3]Natasa Jonoska, Kalpana Mahalingam:
Methods for Constructing Coded DNA Languages. Aspects of Molecular Computing 2004: 241-253 - 2003
- [c2]Natasa Jonoska, Kalpana Mahalingam:
Languages of DNA Based Code Words. DNA 2003: 61-73 - 2002
- [c1]Natasa Jonoska, David Kephart, Kalpana Mahalingam:
Generating DNA Code Words. GECCO Late Breaking Papers 2002: 240-246
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 01:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
