Abstract
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 ⩽ κ,= κ,⩾ κ, for κ ⩾ ℓ, as well as the internally hybrid modes (⩾ κ∧⩽ℓ), for κ, ℓ∈N, κ⩽ℓ, and (t∧⩽κ), (t∧ =κ), (t∧⩾κ), for κ ⩾ 1. Moreover, we also show how these tissue P systems working in the sequential mode allow for the simulation of random context grammars, too.