scispace - formally typeset
Search or ask a question

Showing papers by "Kamala Krithivasan published in 2010"


Book ChapterDOI
01 Dec 2010
TL;DR: It is proved that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) and an important result that the ambiguity problem of insertion- deletion system is undecidable.
Abstract: In DNA processing and RNA editing, gene insertion and deletion are considered as the basic operations. Based on the above evolutionary transformations, a computing model has been formulated in formal language theory known as insertion-deletion systems. In this paper we study about ambiguity and complexity measures of these systems. First, we define the various levels of ambiguity (i = 0,1,2,3,4,5) for insertion-deletion systems. Next, we show that there are inherently i-ambiguous insertion-deletion languages which are j-unambiguous for the combinations (i, j) ∈ {(5,4), (4,2), (3,1), (3,2), (2,1),(0,1)}. Further, We prove an important result that the ambiguity problem of insertion-deletion system is undecidable. Finally, we define three new complexity measures TLength − Con, TLength − Ins, TLength − Del for insertion-deletion systems and analyze the trade-off between the newly defined ambiguity levels and complexity measures.

6 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: A direct correspondence is observed between the Petri net representation of the proposed model and standard solution based on Petri nets already present in the literature.
Abstract: In this paper we present the relation between Spiking Neural P (SN P) systems and Petri nets by focusing on modeling simplex stop-and-wait protocol. The SN P system for the protocol is constructed and also translated it into equivalent Petri net with a corresponding semantics. It is then observed a direct correspondence between the Petri net representation of the proposed model and standard solution based on Petri nets already present in the literature.

4 citations


Book ChapterDOI
01 Dec 2010
TL;DR: A formal method based on Petri nets is proposed, which provides a natural and powerful framework to formalize SN P systems with anti-spikes, which enables the use of existing tools for Petrinets to study the computability and behavioural properties of SN P system withAnti-spike.
Abstract: Spiking Neural P(SN P) system with anti-spikes uses two types of objects called spikes and anti-spikes which can encode binary digits in a natural way. We propose a formal method based on Petri nets, which provides a natural and powerful framework to formalize SN P systems with anti-spikes. This enables the use of existing tools for Petri nets to study the computability and behavioural properties of SN P systems with anti-spikes.

2 citations