K.G. SUBRAMANIAN

Prof. K.G. SUBRAMANIAN


Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 November 2013 in Annals of Mathematics and Artificial Intelligence
Verified
Journal Article
Closed access
PDF file
Henning FernauHenning Fernau
Henning Fernau
RFRudolf Freund
Rudolf Freund
MSMarkus L. Schmid
Markus L. Schmid
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN
PWPetra Wiederhold
Petra Wiederhold

1 April 2007 in Progress in Natural Science: Materials International
Verified
Journal Article
Closed access
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN
RSR. Saravanan
R. Saravanan
MGM. Geethalakshmr
M. Geethalakshmr
PCP. Helen Chandra
P. Helen Chandra
MMM. Margenstern
M. Margenstern
Array P systems were introduced by Paun Gh. which is linking the two areas of membrane computing and picture grammars. Puzzle grammars were introduced by us for generating connected picture arrays in the two-dimensional plane, motivated by the problem of tiling the plane. On the other hand, incorporating into arrays the developmental type of generation used in the well-known biologically motivated L systems, Siromoney and Siromoney proposed a very general rectangular array generating model, called extended controlled tabled L array system (ECTLAS). In this paper we introduce two variations of the array P system, called BPG array P system and parallel array P system. The former has in the regions array objects and basic puzzle grammar rules (BPG), which are a specific kind of puzzle grammar rules. In the latter, the regions have rectangular array objects and tables of context-free rules. We examine these two types of P systems for their array generative power.

26 November 2021 in Journal of Membrane Computing
Verified
Journal Article
Closed access
PDF file
SBSomnath Bera
Somnath Bera
RCRodica Ceterchi
Rodica Ceterchi
SSSastha Sriram
Sastha Sriram
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN

21 May 2021 in Journal of Membrane Computing
Verified
Journal Article
Closed access
PDF file
RCRodica Ceterchi
Rodica Ceterchi
LZLuping Zhang
Luping Zhang
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN
Gexiang ZhangGexiang Zhang
Gexiang Zhang

25 May 2021 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
NTNobin Thomas
Nobin Thomas
LMLisa Mathew
Lisa Mathew
SSSastha Sriram
Sastha Sriram
Atulya K NagarAtulya K Nagar
Atulya K Nagar
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN
Relating graph structures with words which are finite sequences of symbols, Parikh word representable graphs (PWRGs) were introduced. On the other hand, in chemical graph theory, graphs have been associated with molecular structures. Also, several topological indices have been defined in terms of graph parameters and studied for different classes of graphs. In this study, we derive expressions for computing certain topological indices of PWRGs of binary core words, thereby enriching the study of PWRGs.

1 January 2009 in Fundamenta Informaticae
Verified
Journal Article
Closed access
PDF file
KSK.G. SUBRAMANIAN
K.G. SUBRAMANIAN
RARosihan M. Ali
Rosihan M. Ali
Atulya K NagarAtulya K Nagar
Atulya K Nagar
MMMaurice Margenstern
Maurice Margenstern
The two areas of grammar systems and P systems, which have provided interesting computational models in the study of formal string language theory have been in the recent past effectively linked in [4] by incorporating into P systems, a communication mode called t–mode of cooperating distributed grammar systems. On the other hand cooperating array grammar systems [5] and array P systems [1] have been developed in the context of two-dimensional picture description. In this paper, motivated by the study of [4], these two systems are studied by linking them through the t–communication mode, thus bringing out the picture description power of these systems.