Abstract

Pure 2D context-free grammar (P2DCFG) with an independent mode of array rewriting, was recently introduced and named as IP2DCFG. Here we consider a variant of IP2DCFG, called (l/u)IP2DCFG, by requiring rewriting of the leftmost (respy. uppermost) symbol in every row (respy. column) of an array, with the symbol having a rewriting rule in a given set of pure context-free rules. We introduce an array P system with (l/u)IP2DCFG kind of rules and array rewriting in its membranes. When two membranes are used in the array P system, the array generative power is increased compared to using a single membrane.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call