Kalpana Mahalingam

Orcid: 0000-0003-2418-0512

According to our database1, Kalpana Mahalingam authored at least 62 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Rich words in the block reversal of a word.
Discret. Appl. Math., July, 2023

2022
Primitivity of Atom Watson-Crick Fibonacci Words.
J. Autom. Lang. Comb., 2022

HV-Palindromes in Two-Dimensional Words.
Int. J. Found. Comput. Sci., 2022

Enumeration of two dimensional palindromes.
Inf. Comput., 2022

Counting (Watson-Crick) palindromes in Watson-Crick conjugates.
Inf. Comput., 2022

Properties of m-bonacci-sum graphs.
Discret. Appl. Math., 2022

Watson-Crick conjugates of words and languages.
CoRR, 2022

Watson-Crick Jumping Finite Automata: Combination, Comparison and Closure.
Comput. J., 2022

Watson-Crick Powers of a Word.
Proceedings of the Algebraic Informatics - 9th International Conference, 2022

2021
Block reversal on finite words.
Theor. Comput. Sci., 2021

Time Varying Splicing Recognizers.
SN Comput. Sci., 2021

Involutive Fibonacci Words.
J. Autom. Lang. Comb., 2021

Counting scattered palindromes in a finite word.
CoRR, 2021

Generalized Circular One-Way Jumping Finite Automata.
CoRR, 2021

Generalized Linear One-Way Jumping Finite Automata.
CoRR, 2021

m-Bonacci graceful labeling.
AKCE Int. J. Graphs Comb., 2021

2020
On the least number of palindromes in two-dimensional words.
Theor. Comput. Sci., 2020

On Szilard Languages of InsDel Systems.
J. Autom. Lang. Comb., 2020

Watson-Crick Jumping Finite Automata.
Int. J. Found. Comput. Sci., 2020

Parikh q-Matrices and q-Ambiguous Words.
Int. J. Found. Comput. Sci., 2020

On Commuting Parikh <i>q</i>-Matrices.
Fundam. Informaticae, 2020

Theta Palindromes in Theta Conjugates.
Proceedings of the Theory and Practice of Natural Computing - 9th International Conference, 2020

2019
Palindromes in two-dimensional Words.
CoRR, 2019

Operation Insertion on the Conjugacy and Commutativity of Words.
Proceedings of the Theory and Practice of Natural Computing - 8th International Conference, 2019

Combinatorial Properties of Fibonacci Arrays.
Proceedings of the Theory and Applications of Models of Computation, 2019

On the Maximum Number of Distinct Palindromic Sub-arrays.
Proceedings of the Language and Automata Theory and Applications, 2019

On m-Bonacci-Sum Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019

2018
Relative Watson-Crick Primitivity of Words.
J. Autom. Lang. Comb., 2018

Labelled graph rules in P systems.
Iran J. Comput. Sci., 2018

Properties of Parikh Matrices of Binary Words Obtained by an Extension of a Restricted Shuffle Operator.
Int. J. Found. Comput. Sci., 2018

On Derivation Languages of a Class of Splicing Systems.
Acta Cybern., 2018

2017
Label Languages of 8-directional Array P System.
CoRR, 2017

Watson-Crick Partial Words.
Proceedings of the Theory and Practice of Natural Computing - 6th International Conference, 2017

Two-Dimensional Palindromes and Their Properties.
Proceedings of the Language and Automata Theory and Applications, 2017

Derivation Languages of Splicing P Systems.
Proceedings of the Bio-inspired Computing: Theories and Applications, 2017

2016
Structural Properties of Word Representable Graphs.
Math. Comput. Sci., 2016

Some Algebraic Aspects of Parikh <i>q</i>-Matrices.
Int. J. Found. Comput. Sci., 2016

2015
Pictures and Chomsky Languages in Array P System.
Proceedings of the Membrane Computing, 2015

2014
Morphisms and Weak-Ratio Property.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014

2013
Two-Dimensional Digitized Picture Arrays and Parikh Matrices.
Int. J. Found. Comput. Sci., 2013

2012
Relativized codes.
Theor. Comput. Sci., 2012

Product of Parikh Matrices and Commutativity.
Int. J. Found. Comput. Sci., 2012

Generating DNA Code Words Using Forbidding and Enforcing Systems.
Proceedings of the Theory and Practice of Natural Computing, 2012

2011
Theoretical and computational properties of transpositions.
Nat. Comput., 2011

Binary Images, <i>M</i> -Vectors, and Ambiguity.
Proceedings of the Combinatorial Image Analysis - 14th International Workshop, 2011

Context-Free Systems with a Complementarity Relation.
Proceedings of the Sixth International Conference on Bio-Inspired Computing: Theories and Applications, 2011

2010
Watson-Crick palindromes in DNA computing.
Nat. Comput., 2010

A relation by palindromic subwords.
Nat. Comput., 2010

Palindromic completion of a word.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010

2009
Twin-roots of words and their properties.
Theor. Comput. Sci., 2009

2008
Watson-Crick Bordered Words and their Syntactic Monoid.
Int. J. Found. Comput. Sci., 2008

Involution Solid and Join codes.
Fundam. Informaticae, 2008

2007
Involutively Bordered Words.
Int. J. Found. Comput. Sci., 2007

The syntactic monoid of hairpin-free languages.
Acta Informatica, 2007

Watson-Crick Conjugate and Commutative Words.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007

2006
Involution Solid Codes.
Proceedings of the Nanotechnology: Science and Computation, 2006

DNA Codes and Their Properties.
Proceedings of the DNA Computing, 12th International Meeting on DNA Computing, 2006

2005
Involution codes: with application to DNA coded languages.
Nat. Comput., 2005

2004
Involution Codes with Application to DNA Strand Design.
PhD thesis, 2004

Methods for Constructing Coded DNA Languages.
Proceedings of the Aspects of Molecular Computing, 2004

2003
Languages of DNA Based Code Words.
Proceedings of the DNA Computing, 9th International Workshop on DNA Based Computers, 2003

2002
Generating DNA Code Words.
Proceedings of the Late Breaking papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), 2002


  Loading...