According to our database1, Kalpana Mahalingam authored at least 32 papers between 2002 and 2019.
Legend:Book In proceedings Article PhD thesis Other
On m-Bonacci-Sum Graphs.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2019
Relative Watson-Crick Primitivity of Words.
Journal of Automata, Languages and Combinatorics, 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
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
Structural Properties of Word Representable Graphs.
Mathematics in Computer Science, 2016
Some Algebraic Aspects of Parikh q-Matrices.
Int. J. Found. Comput. Sci., 2016
Pictures and Chomsky Languages in Array P System.
Proceedings of the Membrane Computing, 2015
Morphisms and Weak-Ratio Property.
Proceedings of the Discrete Mathematics and Computer Science. In Memoriam Alexandru Mateescu (1952-2005)., 2014
Two-Dimensional Digitized Picture Arrays and Parikh Matrices.
Int. J. Found. Comput. Sci., 2013
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
Theoretical and computational properties of transpositions.
Natural Computing, 2011
Binary Images, M -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
Watson-Crick palindromes in DNA computing.
Natural Computing, 2010
A relation by palindromic subwords.
Natural Computing, 2010
Palindromic completion of a word.
Proceedings of the Fifth International Conference on Bio-Inspired Computing: Theories and Applications, 2010
Twin-roots of words and their properties.
Theor. Comput. Sci., 2009
Watson-Crick Bordered Words and their Syntactic Monoid.
Int. J. Found. Comput. Sci., 2008
Involutively Bordered Words.
Int. J. Found. Comput. Sci., 2007
The syntactic monoid of hairpin-free languages.
Acta Inf., 2007
Watson-Crick Conjugate and Commutative Words.
Proceedings of the DNA Computing, 13th International Meeting on DNA Computing, 2007
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
Involution Solid and Join Codes.
Proceedings of the Developments in Language Theory, 10th International Conference, 2006
Involution codes: with application to DNA coded languages.
Natural Computing, 2005
Methods for Constructing Coded DNA Languages.
Proceedings of the Aspects of Molecular Computing, 2004
Languages of DNA Based Code Words.
Proceedings of the DNA Computing, 9th International Workshop on DNA Based Computers, 2003
Generating DNA Code Words.
Proceedings of the Late Breaking papers at the Genetic and Evolutionary Computation Conference (GECCO-2002), 2002