Name
Abstract | ||
|---|---|---|
Motivated by the problem of tiling the plane, puzzle grammars were introduced as a mechanism for generating languages of picture arrays in the two-dimensional plane. On the other hand BPG array P system with array objects and basic puzzle grammar (BPG) rules was introduced as a variant of array generating P systems that were developed with a view to link the two areas of membrane computing and picture array grammars. Here we incorporate the feature of permitting symbols in the rules of the BPG array P system, thus introducing permitting array P system with BPG rules (pAP(BPG)). We show that the permitting feature gives more generative power to the BPG array P system with one or two membranes. We also show that a pAP(BPG) with only two membranes under t-communication mode, can generate picture arrays of square frames. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-54072-6_17 | Lecture Notes in Computer Science |
Field | DocType | Volume |
Rule-based machine translation,Generative power,Computer science,Algorithm,Emergent grammar,Grammar,Theoretical computer science,Phrase structure rules,Rewriting,Membrane computing,P system | Conference | 10105 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pradeep Isawasan | 1 | 1 | 1.70 |
| Ravie Chandren Muniyandi | 2 | 31 | 11.19 |
| Ibrahim Venkat | 3 | 70 | 14.37 |
| K. G. Subramanian | 4 | 339 | 59.27 |