Insertion-Deletion P Systems

Authors:
Shankara Narayanan Krishna;Raghavan Rama
Affiliations:
-;-
Venue:
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Year:
2001

Citing 5
Cited 1

Contextual insertions/deletions and computability

Information and Computation
Handbook of formal languages, vol. 3: beyond words

Handbook of formal languages, vol. 3: beyond words
Computing with cells and atoms: an introduction to quantum, DNA and membrane computing

Computing with cells and atoms: an introduction to quantum, DNA and membrane computing
Computing with Membranes

Computing with Membranes
DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

Simulating accepting networks of evolutionary processors with filtered connections by accepting evolutionary P systems

IWINAC'11 Proceedings of the 4th international conference on Interplay between natural and artificial computation - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

New computability models, called P systems, based on the evolution of objects in a membrane structure were recently introduced. This paper presents a new variant of P systems with string objects having insertion-deletion rules as the control structure. The use of this control structure is motivated from the DNA Computing area where insertions and deletions of small strands of DNA happen frequently in all types of cells and constitute also one of the methods used by some viri to infect a host. We investigate here the power of this type of systems with less than four membranes, in comparison with the families of CF, MAT and RE.