Kamala Krithivasan

Bio: Kamala Krithivasan is an academic researcher from Indian Institute of Technology Madras. The author has contributed to research in topics: Automata theory & Context-sensitive grammar. The author has an hindex of 14, co-authored 122 publications receiving 696 citations. Previous affiliations of Kamala Krithivasan include Madras Christian College & Indian Institutes of Technology.

An Adaptive e-Learning Environment Using Distributed Spiking Neural P Systems

Abstract: The motivation behind the proposed research work is the need for an innovative e-learning system that can adapt to the learning capability of every individual. Adaptive e-learning systems create new opportunities and at the same time have several research challenges that need to be addressed. The primary requirement of such adaptive systems is the need to create and represent adaptable content effectively. This paper presents a membrane computing model to demonstrate how adaptable content can be represented and used efficiently. The Spiking Neural P System (SNP) is a membrane computing model inspired by the way neurons communicate by means of spikes. This paper proposes the Distributed Spiking Neural P System (DSNP), a variant of the existing Distributed P System, that can be used to represent dynamic and distibuted systems. Temporal relations captured on a time line during authoring of the ecourse, can be automatically converted into an SNP system using the algorithm presented in the paper. An algorithm for the automatic generation of the DSNP from the e-course compositions represented using a linked list of SNPs is also presented in the paper along with experimental results to prove the efficiency and scalability of the proposed model.

Universality results for some variants of P systems

Abstract: P systems, introduced by Gh. Paun, form a new class of distributed computing models. Many variants of P systems were shown to be computationally universal. In this paper, we consider several classes of P systems with symbol-objects where we allow the catalysts to move in and out of a membrane. We prove universality results for these variants of P systems with a very small number of membranes.

The Book of L

Abstract: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model.- Fibonacci Words - A Survey.- Planar Map Generation by Parallel Binary Fission/Fusion Grammars.- Modular Trellises.- A New Proof for the DOL Sequence Equivalence Problem and its Implications.- On Compound Lindenmayer Systems.- Graph Grammars with Application Conditions.- The ETOL Hierarchy is in the OI Hierarchy.- Polyhedral Cell Shapes.- On Cyclically Overlap-Free Words in Binary Alphabets.- The Theoretical Basis of the Transplantation Experiment.- Fixed and Stationary ?-Words and ?-Languages.- DOL Schemes and Recurrent Words.- Stochastic OL Systems and Formal Power Series.- Complexity of L-Systems.- Compartmental Hybrid State Production-Diffusion Systems with Application to Prestalk-Prespore Pattern Regulation in Cellular Slime Molds.- Hierarchical Aspects of Plant Development.- Rule Trees Represent Derivations in Edge Replacement Systems.- Languages Defined by Indian Parallel Systems.- L Systems and NLOG-Reductions.- The Parikh-Boundedness of ETOL Languages of Finite Index.- Computer Networks with Compact Routing Tables.- Unconventional Leaves.- A Uniform Model for the Growth of Biological Organisms: Cooperating Sequential Processes.- Graph Technology Applied to a Software Project.- Some Systems for Map Generation.- A Programming Language for Lindenmayer Systems.- A Note on Significance of Cellular Interaction in L-System.- EOL Grammars and Search Trees.- Variation in Inflorescence Structure in Cotoneaster Franchetti.- Partial Path Groups and Parallel Graph Contractions.- When L was Young.- Equivalence Problems for Regular Sets of Word Morphisms.- Parentheses Grammars and Lindenmayer Grammars.- Array Languages and Lindenmayer Systems - A Survey.- Symmetric Distributed Termination.- Development, Growth and Time.- On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language.- Graph-Controlled Systems - An Extension of OL Systems.

Introduction to Membrane Computing

Abstract: This is a comprehensive (and friendly) introduction to membrane computing (MC), meant to offer both computer scientists and non-computer scientists an up-to-date overview of the field. That is why the set of notions introduced here is rather large, but the presentation is informal, without proofs and with rigorous definitions given only for the basic types of P systems — symbol object P systems with multiset rewriting rules, systems with symport/antiport rules, systems with string objects, tissue-like P systems, and neural-like P systems. Besides a list of (biologically inspired or mathematically motivated) ingredients/features which can be used in systems of these types, we also mention a series of results, as well as a series of research trends and topics.