Showing papers by "Kamala Krithivasan published in 2001"
23 May 2001
TL;DR: A new variant of P systems, P systems with membrane creation, in which some objects are productive and create membranes is proposed, capable of solving the Hamiltonian Path Problem in linear time.
Abstract: P systems, introduced by Gh. Paun form a new class of distributed computing model. Several variants of P systems were already shown to be computationally universal. In this paper, we propose a new variant of P systems, P systems with membrane creation, in which some objects are productive and create membranes. This new variant of P systems is capable of solving the Hamiltonian Path Problem in linear time. We show that P systems with membrane creation are computationally complete.
54 citations
[...]
TL;DR: This paper defines L -Fuzzy ω -Automata and gives some examples to show how it can be used to accept some non-fuzzy languages which are not accepted by their classical counterparts.
16 citations
10 Jun 2001
TL;DR: This paper shows how to use peptide experiments to solve the Hamiltonian Path Problem (HPP) and a particular version of Set Cover problem called Exact Cover by 3-Sets problem and proves that this of model of computation is computationally complete.
Abstract: This paper considers a computational model using the peptide-antibody interactions. These interactions which are carried out in parallel can be used to solve NP-complete problems. In this paper we show how to use peptide experiments to solve the Hamiltonian Path Problem (HPP) and a particular version of Set Cover problem called Exact Cover by 3-Sets problem. We also prove that this of model of computation is computationally complete.
14 citations
01 Jan 2001
2 citations
TL;DR: It is found that out of the four orthogonal polygons with two reflex angles, three are orthoconvex and the algorithms presented for these polygons work in time, where n could be O(n-k)3 in the worst case.
Abstract: We present in this paper, algorithms for finding the minimum area isothetic polygons having two reflex angles containing k points; (k
1 citations
TL;DR: The theoretical construct of Cooperating Distributed Weighted Finite Automata with n-components (n-WFA) is defined and the power of this construct in various modes of acceptance is studied.
1 citations
01 Feb 2001
TL;DR: In this paper, restricted versions of simple H systems of type (1, 3) and (4) were defined and it was shown that the generative power is not decreased by this restriction.
Abstract: In this paper we define restricted versions of simple H systems of type (1,3) and (1,4) and show that the generative power is not decreased by this restriction. In the case of these systems the power is not increased by having a target alphabet whereas having permitting context increases the power.
Journal Article•
TL;DR: This paper considers several classes of P systems with symbol-objects where the authors allow the catalysts to move in and out of a membrane, and proves universality results for these variants of P system with a very small number of membranes.
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.