On the power of P Systems with contextual rules

Authors:
S. N. Krishna;K. Lakshmanan;R. Rama
Affiliations:
Department of Mathematics, Indian Institute of Technology, Madras Chennai-36, Tamilnadu, India;Department of Mathematics, Indian Institute of Technology, Madras Chennai-36, Tamilnadu, India;Department of Mathematics, Indian Institute of Technology, Madras Chennai-36, Tamilnadu, India
Venue:
Fundamenta Informaticae - Membrane computing
Year:
2002

Citing 5
Cited 2

Computing with membranes

Journal of Computer and System Sciences
P systems with active membranes: attacking NP-complete problems

Journal of Automata, Languages and Combinatorics
Marcus Contextual Grammars

Marcus Contextual Grammars
Handbook of Formal Languages

Handbook of Formal Languages
Computing with Membranes: Variants with an Enhanced Membrane Handling

DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing

A Survey of Some Variants of P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Further Results on Contextual and Rewriting P Systems

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.