Contextual P Systems

Authors:
Kamala Krithivasan;Mutyam Madhu
Affiliations:
Theoretical Computer Science Laboratory, Dept. of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai-36, Tamil Nadu, India.;Theoretical Computer Science Laboratory, Dept. of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai-36, Tamil Nadu, India.
Venue:
Fundamenta Informaticae - Membrane computing
Year:
2002

Citing 5
Cited 3

Membrane computing with external output

Fundamenta Informaticae
Computing with membranes

Journal of Computer and System Sciences
Marcus Contextual Grammars

Marcus Contextual Grammars
Handbook of Formal Languages

Handbook of Formal Languages
Regulated Rewriting in Formal Language Theory

Regulated Rewriting in Formal Language Theory

A Survey of Some Variants of P Systems

WMC-CdeA '02 Revised Papers from the International Workshop on Membrane Computing
Rewriting P systems: improved hierarchies

Theoretical Computer Science
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

Generally, in P systems with string-objects one uses the Chomsky way of rewriting for processing the objects. In this paper we consider the contextual way of handling string-objects in P systems. We introduce some variants of contextual grammars and prove that contextual P systems with rules corresponding to these variants are more powerful than ordinary contextual grammars and their variants. We also show that one-sided contextual P systems with right-sided erased contexts and insertion contextual P systems with right-sided erased contexts are computationally complete.