2007
DOI: 10.1080/10020070708541026
|View full text |Cite
|
Sign up to set email alerts
|

P systems with array objects and array rewriting rules

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
6
0

Year Published

2009
2009
2021
2021

Publication Types

Select...
5
3

Relationship

1
7

Authors

Journals

citations
Cited by 17 publications
(6 citation statements)
references
References 3 publications
0
6
0
Order By: Relevance
“…The family of array languages generated by such systems with at most n components in the maximal derivation mode is denoted by CD n (BP G, t). On the other hand in [23] array P systems with array objects and basic puzzle grammar rules in the regions of the system are considered. These P systems are called as BPG array P systems.…”
Section: Proofmentioning
confidence: 99%
See 2 more Smart Citations
“…The family of array languages generated by such systems with at most n components in the maximal derivation mode is denoted by CD n (BP G, t). On the other hand in [23] array P systems with array objects and basic puzzle grammar rules in the regions of the system are considered. These P systems are called as BPG array P systems.…”
Section: Proofmentioning
confidence: 99%
“…The generation will proceed analogous to the generation of a rectangle in the proof of Theorem 3.4 except that the 'protrusions' in the corners will be produced. It is known [23] that R hf ∈ CD 2 (REG, t). In fact the generation of a hollow rectangular frame of a s in the t−communicating array P system given here is based on the technique used in [23] except that the type tin of the array P system sends the array to an inner region.…”
Section: Proofmentioning
confidence: 99%
See 1 more Smart Citation
“…The advantage of this approach is that there is a reduction in the number of membranes in comparison to other array P system models. This idea of permitting features is also used in [86], where the authors bridge these concepts with array P system that uses basic puzzle grammar [159,161]. Another variant of array P system, called tabled parallel array P system, was introduced in [87] by employing a well-known technique, called tables of rules, of grouping rules, especially used in Lindenmayer systems [146].…”
mentioning
confidence: 99%
“…Subsequently, a number of P systems with array objects and different kinds of rewriting were introduced in [5,10,11]. The two dimensional grammar models called puzzle grammars for generating connected arrays of unit cells are discussed in [12,13]. The comparisons with pure two dimensional context-free grammars and extension of P2DCFG are discussed with array rewriting P system model in [14,15].…”
Section: Introductionmentioning
confidence: 99%