scispace - formally typeset
Search or ask a question
Author

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.


Papers
More filters
Journal ArticleDOI
01 Dec 2002-Grammars
TL;DR: The study of hybrid P systems is continued, and it is shown that systems with two membranes are universal in the case of contextual rules with a regular choice, and systems with four membranes areuniversal in the cases of contextual Rules with finite selection.
Abstract: Generally, in rewriting P systems (Martin-Vide and Paun, 2000) one uses Chomsky rules (Hopcroft and Ullman, 1979), whereas in contextual P systems (Madhu and Krithivasan, 2002) we considered contextual rules (Marcus, 1969), (Paun, 1997) for processing string-objects. By combining Chomsky rules and contextual rules, a new class of P systems were introduced in Krishna et al. (2001), the hybrid P systems. In this paper we continue the study of hybrid P systems, and show that systems with two membranes are universal in the case of contextual rules with a regular choice, and systems with four membranes are universal in the case of contextual rules with finite selection.

5 citations

Journal ArticleDOI
TL;DR: An important result is proved that the ambiguity problem of insertion–deletion systems is undecidable and six levels of ambiguity are defined based on the components used in the derivation such as axiom, contexts and strings.

5 citations

Proceedings ArticleDOI
15 Mar 2010
TL;DR: A novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs is proposed, based on Prüfer encoding and decoding techniques of trees using this metric.
Abstract: Network topology discovery is the basis for any network management application. The problem of estimating internal structure and link-level performance from end-to-end measurements is known as network tomography. This paper proposes a novel approach to discover network characteristics, in particular, tree topology from the hop count metric (distance) between OD (Origin — Destination) pairs. The proposed method is based on Prufer encoding and decoding techniques of trees using this metric. The method also has the potential to minimize and avoid reliance on ICMP.

5 citations

Journal ArticleDOI
TL;DR: It is seen that periodically time varying pushdown automata accept exactly the class of context-free languages.
Abstract: Time varying pushdown automata (PDA) are defined and equivalence between two modes of acceptance shown. It is seen that periodically time varying pushdown automata accept exactly the class of context-free languages. Time varying generalized PDA are defined and their equivalence to terminal weighted context free grammars in GNF shown. It is shown that TVGPDA can be simulated by TVPDA. Thus TVPDA give another machine characterization of recursively enumerable sets.

5 citations


Cited by
More filters
Journal ArticleDOI
TL;DR: The present paper presents the basic ideas of computing with membranes and some fundamental properties (mostly concerning the computational power and efficiency) of P systems of various types.

370 citations

Book
01 Jan 1986
TL;DR: Investigations into Drosophila Wing Development - Results from a Lindenmayer Model and the Theoretical Basis of the Transplantation Experiment.
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.

191 citations

Book ChapterDOI
Gheorghe Paun1
01 Jan 2006
TL;DR: 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.
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.

152 citations