Hyperedge Replacement Graph P System

摘要

In this paper we introduce a new graph generative device called hyper edge replacement graph P system. We consider the application of the hyper edge replacement graph rewriting rules in the regions of a parallel rewriting P system with a feature of conditional communication. We examine the generative power of this hyper edge replacement graph P system and obtain some fruitful results.