Wyniki wyszukiwania - BazTech

Ograniczanie wyników

3 Fundamenta Informaticae

Znaleziono wyników: 3

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

On Restricted Bio-Turing Machines

Raghavan R., Ramesh H., Gheorghe M., Krishna S.N.

Fundamenta Informaticae

2011

Vol. 110, nr 1-4

309-320

Here we continue the study of bio-Turing machines introduced in [2] and further investigated in [17]. We introduce a restricted model of bio-Turingmachine and we investigate its computational power, a hierarchy of languages accepted, and deterministic and nondeterministic variants. A comprehensive example illustrating the modelling power of the introduced machine ends the paper.

Further Results on Contextual and Rewriting P Systems

Krishna S. N., Rama R., Ramesh H.

Fundamenta Informaticae

2005

Vol. 64, nr 1-4

241-253

In this paper, we continue the study of contextual and rewriting P systems. In contextual P systems, we improve a universality result avoiding the extended feature and by using rules of small weight. In rewriting P systems, we have two (rather surprising) universality results, both of them using three membranes, for non-extended systems with replicated rewriting and with leftmost rewriting, respectively.

On the Power of P Systems with Contextual Rules

Krishna S.N., Lakshmanan K., Rama R.

Fundamenta Informaticae

2002

Vol. 49, nr 1-3

167-178

We consider P Systems with string objects which evolve by means of one-sided contextual rules and erasing contextual rules. The generative power of these systems with three or less than three membranes is investigated. We show that systems with three membranes characterize the family of recursively enumerable languages. When the string replication is used in one-sided contextual rules, these systems are able of solving NP-complete problems in linear time: this is exemplified with SAT and HPP.