Name
Affiliation
Papers
K. G. SUBRAMANIAN
Madras Christian College, Tambaram, Madras, India
113
Collaborators
Citations 
PageRank 
103
339
59.27
Referers 
Referees 
References 
322
846
765
Search Limit
100846
Title
Citations
PageRank
Year
Hilbert words as arrays generated with P systems00.342021
Parikh Q-Matrices And Q-Ambiguous Words00.342020
A New Study Of Parikh Matrices Restricted To Terms00.342020
Some results on Parikh word representable graphs and partitions00.342019
Approximating Polygons for Space-Filling Curves Generated with P Systems.00.342018
Chain Code P System Generating a Variant of the Peano Space-Filling Curve.00.342018
Properties Of Parikh Matrices Of Binary Words Obtained By An Extension Of A Restricted Shuffle Operator10.362018
Chain Code P System For Generation Of Approximation Patterns Of Sierpinski Curve00.342018
Two-dimensional pattern languages.00.342017
Non-Isometric Contextual Array Grammars and the Role of Regular Control and Local Selectors.10.362017
Contextual array grammars with matrix control, regular control languages, and tissue P systems control.20.372017
Grammar Systems Based on Equal Matrix Rules and Alphabetic Flat Splicing.00.342016
Intelligent Evacuation Management Systems: A Review.40.372016
Rewriting P Systems with Flat-Splicing Rules.00.342016
Foreword to the Special Focus on Graph Theory and Applications.00.342016
Contextual Array Grammars with Matrix and Regular Control.10.382016
Array-Rewriting P Systems with Basic Puzzle Grammar Rules and Permitting Features.00.342016
Matrix Flat Splicing Systems.00.342016
The Impact of Bio-Inspired Approaches Toward the Advancement of Face Recognition20.352015
Generating Picture Arrays Based on Grammar Systems with Flat Splicing Operation.00.342015
Non-isometric Contextual Array Grammars with Regular Control and Local Selectors20.412015
Uniform Solution to Common Algorithmic Problem by P Systems Working in the Minimally Parallel Mode.00.342015
Contextual array grammars and array P systems70.542015
Picture Array Generation Using Pure 2D Context-Free Grammar Rules.10.362015
A Picture Array Generating Model Based on Flat Splicing Operation.00.342015
Morphisms and Weak-Ratio Property.10.372014
Array P systems with permitting features.00.342014
A Variant Of Pure Two-Dimensional Context-Free Grammars Generating Picture Languages20.412014
Uniform Solution to Common Algorithmic Problem in the Minimally Parallel Mode.00.342014
Hyperbolic Tilings And Formal Language Theory10.372013
Two-Dimensional Digitized Picture Arrays And Parikh Matrices10.352013
One-Dimensional Array Grammars And P Systems With Array Insertion And Deletion Rules20.382013
Array Insertion And Deletion P Systems20.392013
On the power of permitting features in cooperating context-free array grammar systems00.342013
Recognizing occluded faces by exploiting psychophysically inspired similarity maps80.472013
P Systems with Shuffle Operation and Catalytic-Like Rules.00.342012
A Tissue P System Based Solution To Quadratic Assignment Problem00.342012
On Watson-Crick automata00.342012
Permitting Features in P Systems Generating Picture Arrays.10.362012
Product Of Parikh Matrices And Commutativity70.612012
A P System Model for Contextual Array Languages.10.372012
Sturmian Arrays.00.342011
Binary images, M-vectors, and ambiguity10.352011
Psychophysically inspired bayesian occlusion model to recognize occluded faces20.392011
Self Cross-Over Array Languages.00.342011
Fuzzy Puzzle Grammars and Languages.00.342011
Context-Free Systems with a Complementarity Relation10.392011
A P system model with pure context-free rules for picture array generation40.442010
Palindromic completion of a word.20.382010
P systems with shuffle operation.10.362010
  • 1
  • 2