首页> 外文会议>Computer Modelling and Simulation, 2009. UKSIM '09 >Array P System Model with Pure Context-Free Rules
【24h】

Array P System Model with Pure Context-Free Rules

机译:具有纯上下文无关规则的Array P系统模型

获取原文

摘要

Motivated by the structure and functioning of the living cell, a new computing model, called P system, was proposed in the area of membrane computing. Among several areas of application of P systems, one area is concerned with generation of picture array languages. Ceterchi et al. initially proposed array-rewriting P systems by extending the notion of string-rewriting P-systems. On the other hand a new theoretical model of grammatical picture generation called pure 2D context-free picture grammar (P2DCFPG) generating rectangular picture arrays of symbols has been introduced by Subramanian et al.. Here we consider P2DCFPG type of rules in array-rewriting P systems and examine the generating power of the resulting array P systems.
机译:由于活细胞的结构和功能,在膜计算领域提出了一种称为P系统的新计算模型。在P系统的几个应用领域中,一个领域涉及图像阵列语言的生成。 Ceterchi等。最初提出的数组重写P系统是通过扩展字符串重写P系统的概念来实现的。另一方面,Subramanian等人介绍了一种新的语法图片生成理论模型,称为纯2D上下文无关图片语法(P2DCFPG),它生成符号的矩形图片数组。在此,我们考虑数组重写P中的P2DCFPG类型规则系统,并检查所得阵列P系统的发电能力。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号