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.

Modelling and simulation of sn p systems using petri nets

Abstract: Natural computing deals with the extraction of mathematical models of computation from nature, investigating their theoretical properties, and identifying the extent of their real-world applications. P systems (also called membrane systems) were introduced as parallel computational models inspired by the hierarchical structure of membranes in living organisms and the biological processes which take place in and between cells. Spiking neural P systems (for short, SN P systems) are a class of P systems inspired by the spiking activity of neurons in the brain. An SN P system is represented as a directed graph where nodes correspond to the neurons having spiking and forgetting rules. The rules involve the spikes present in the neuron in the form of occurrences of a symbol a. It is a versatile formal model of computation that can be used for designing efficient parallel algorithms for solving known computer science problems. SN P systems are used as a computing device in various ways generators, acceptors, and transducers. SN P system with anti-spikes (for short, SN PA systems) is a variant of SN P system containing two types of objects, spikes (denoted by a) and anti-spikes (denoted by a), corresponding somewhat to inhibitory impulses from neurobiology. Because of the use of two types of objects, the system can encode the binary digits in a natural way and hence can represent the formal models more efficiently and naturally than the SN P systems. The thesis investigates the computing power of spiking neural P system with anti-spikes as language generators and transducers. We show that SN PA systems as generators can generate languages that cannot be generated by the standard SN P systems. It is demonstrated that, as transducers, spiking neural P systems with anti-spikes can simulate any Boolean circuit and computing devices such as finite automata and finite transducers. We also investigate how the use of anti-spikes in spiking neural P systems affect the capability to solve the satisfiability problem in a non-deterministic way.

Algorithm for Reconstructing 3D-Binary Matrix with Periodicity Constraints from Two Projections

Abstract: We study the problem of reconstructing a three dimensional binary matrices whose interiors are only accessible through few projections. Such question is prominently motivated by the demand in material science for developing tool for reconstruction of crystalline structures from their images obtained by high-resolution transmission electron microscopy. Various approaches have been suggested to reconstruct 3D-object(crystalline structure) by reconstructing slice of the 3D-object. To handle the ill-posedness of the problem, a priori information such as convexity, connectivity and periodicity are used to limit the number of possible solutions. Formally, 3Dobject(crystalline structure) having a priory information is modeled by a class of 3D-binary matrices satisfying a priori information. We consider 3D-binary matrices with periodicity constraints, and we propose a polynomial time algorithm to reconstruct 3D-binary matrices with periodicity constraints from two orthogonal projections. Keywords—3D-Binary Matrix Reconstruction, Computed Tomography, Discrete Tomography, Integral Max Flow Problem.

Probabilistic Parallel Communicating Grammar Systems

Abstract: Grammar systems are theoretical models of distributed computing which play a major role in modern Computer Science. In this paper, we define and study a variant of Parallel Communicating(PC) grammar systems namely, Probabilistic PC grammar systems which serves as a grammatical model for random distributed processing. We study the construct with two different models of communication protocols namely, communication by request and communication by command. We explore the generative capacity of the variant with regular, context-free and context-sensitive rules in both models of communication.

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.