Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode

We consider tissue P systems where rules are applied when moving through a channel from one cell to another one. In a very general manner (i.e., working on arbitrary objects as strings, arrays, graphs, etc.), these tissue P systems equipped with the sequential derivation mode allow for the representation of hybrid co-operating grammar systems using the classic basic derivation modes *,t and ? k,=k, ^(3) k, for k ^(3) 1, as well as the internally hybrid modes ( ^(3) kU` ? l), for k,l Î \mathbbN , k ? l, and (tU` ? k) , ( tU` = k) , (tU` ^(3) k) , for k ^(3) 1. Moreover, we also show how these tissue P systems working in the sequential mode allow for the simulation of random context grammars, too.