Array-rewriting P systems

  • Authors:
  • Rodica Ceterchi;Madhu Mutyam;Gheorghe Pă/un;K. G. Subramanian

  • Affiliations:
  • Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tá/rraco 1, 43005 Tarragona, Spain&semi/ Faculty of Mathematics and Computer Science, University of Buchar ...;Department of Computer Science and Engineering, Indian Institute of Technology, Madras, Chennai 600036, India (E-mail: madhu@cs.iitm.ernet.in);Research Group on Mathematical Linguistics, Rovira i Virgili University, Pl. Imperial Tá/rraco 1, 43005 Tarragona, Spain&semi/ Institute of Mathematics of the Romanian Academy, P.O. Box 1-764, ...;Department of Mathematics, Madras Christian College, Tambaram, Chennai 600059, India (E-mail: kgsmani@vsnl.net)

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider array languages (sets of picturesconsisting of symbols placed in the lattice points of the 2D grid) and thepossibility to handle them with P systems. After proving binary normal formsfor array matrix grammars (which, even in the case when no appearance checking isused, are known to generate the array languages of arbitrary array grammars), weprove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able togenerate all computable array languages. Some open problems are also formulated.