Partial array-rewriting P systems and basic puzzle partial array grammars

In literature the innovative model of partial array languages and partial array rewriting rules are existing, earlier we have defined regular partial array grammar and context free partial array grammar to generate partial array languages. Here, the concept of basic puzzle partial array grammar is introduced to generate partial array languages. We compare these grammars for generating powers. We have also generated partial array languages using extended and non extended partial array rewriting p-system. This is compared with basic puzzle partial array grammar.